| 2013 | ||
|---|---|---|
| c27 | ||
| c26 | André A. Ciré, Elvin Coban, John N. Hooker: Mixed Integer Programming vs. Logic-Based Benders Decomposition for Planning and Scheduling. CPAIOR 2013: 325-331 | |
| 2012 | ||
| c25 | David Bergman, André A. Ciré, Willem Jan van Hoeve, John N. Hooker: Variable Ordering for the Application of BDDs to the Maximum Independent Set Problem. CPAIOR 2012: 34-49 | |
| c24 | ||
| 2011 | ||
| c23 | David Bergman, Willem Jan van Hoeve, John N. Hooker: Manipulating MDD Relaxations for Combinatorial Optimization. CPAIOR 2011: 20-35 | |
| 2010 | ||
| j26 | Tallys H. Yunes, Ionut D. Aron, John N. Hooker: An Integrated Solver for Optimization Problems. Operations Research 58(2): 342-356 (2010) | |
| c22 | Samid Hoda, Willem Jan van Hoeve, John N. Hooker: A Systematic Approach to MDD-Based Constraint Programming. CP 2010: 266-280 | |
| c21 | Elvin Coban, John N. Hooker: Single-Facility Scheduling over Long Time Horizons by Logic-Based Benders Decomposition. CPAIOR 2010: 87-91 | |
| 2009 | ||
| r2 | ||
| r1 | John N. Hooker: Integer Programming: Lagrangian Relaxation. Encyclopedia of Optimization 2009: 1667-1673 | |
| e1 | Willem Jan van Hoeve, John N. Hooker (Eds.): Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 6th International Conference, CPAIOR 2009, Pittsburgh, PA, USA, May 27-31, 2009, Proceedings. Lecture Notes in Computer Science 5547, Springer 2009, isbn 978-3-642-01928-9 | |
| 2008 | ||
| j25 | F. Sibel Salman, R. Ravi, John N. Hooker: Solving the Capacitated Local Access Network Design Problem. INFORMS Journal on Computing 20(2): 243-254 (2008) | |
| c20 | Tarik Hadzic, John N. Hooker, Barry O'Sullivan, Peter Tiedemann: Approximate Compilation of Constraints into Multivalued Decision Diagrams. CP 2008: 448-462 | |
| c19 | Tarik Hadzic, John N. Hooker, Peter Tiedemann: Propagating Separable Equalities in an MDD Store. CPAIOR 2008: 318-322 | |
| c18 | ||
| 2007 | ||
| j24 | John N. Hooker: Planning and Scheduling by Logic-Based Benders Decomposition. Operations Research 55(3): 588-602 (2007) | |
| c17 | Henrik Reif Andersen, Tarik Hadzic, John N. Hooker, Peter Tiedemann: A Constraint Store Based on Multivalued Decision Diagrams. CP 2007: 118-132 | |
| c16 | Tarik Hadzic, John N. Hooker: Cost-Bounded Binary Decision Diagrams for 0-1 Programming. CPAIOR 2007: 84-98 | |
| c15 | ||
| 2006 | ||
| j23 | John N. Hooker: An Integrated Method for Planning and Scheduling to Minimize Tardiness. Constraints 11(2-3): 139-157 (2006) | |
| c14 | ||
| c13 | ||
| 2005 | ||
| j22 | ||
| c12 | ||
| c11 | ||
| c10 | John N. Hooker: A Search-Infer-and-Relax Framework for Integrating Solution Methods. CPAIOR 2005: 243-257 | |
| 2004 | ||
| c9 | ||
| c8 | Ionut D. Aron, John N. Hooker, Tallys H. Yunes: SIMPL: A System for Integrating Optimization Techniques. CPAIOR 2004: 21-36 | |
| 2003 | ||
| c7 | ||
| 2002 | ||
| j21 | Greger Ottosson, Erlendur S. Thorsteinsson, John N. Hooker: Mixed Global Constraints and Inference in Hybrid CLP-IP Solvers. Ann. Math. Artif. Intell. 34(4): 271-290 (2002) | |
| j20 | Hak-Jin Kim, John N. Hooker: Solving Fixed-Charge Network Flow Problems with a Hybrid Optimization and Constraint Programming Approach. Annals OR 115(1-4): 95-124 (2002) | |
| j19 | Giorgio C. Buttazzo, Avi Efrati, John N. Hooker, Claude Le Pape, Joseph Sifakis: Abstracts of Invited Talks. Electr. Notes Theor. Comput. Sci. 65(6): 275-276 (2002) | |
| j18 | John N. Hooker: Logic, Optimization, and Constraint Programming. INFORMS Journal on Computing 14(4): 295-321 (2002) | |
| j17 | John N. Hooker, G. Rago, V. Chandru, A. Shrivastava: Partial Instantiation Methods for Inference in First-Order Logic. J. Autom. Reasoning 28(5): 371-396 (2002) | |
| c6 | ||
| 2001 | ||
| j16 | John N. Hooker, Hak-Jin Kim, Greger Ottosson: A Declarative Modeling Framework that Integrates Solution Methods. Annals OR 104(1-4): 141-161 (2001) | |
| 2000 | ||
| j15 | Greger Ottosson, Erlendur S. Thorsteinsson, John N. Hooker: Mixed Global Constraints and Inference in Hybrid CLP-IP Solvers. Electronic Notes in Discrete Mathematics 4: 32-53 (2000) | |
| 1999 | ||
| j14 | John N. Hooker: Inference Duality as a Basis for Sensitivity Analysis. Constraints 4(2): 101-112 (1999) | |
| j13 | John N. Hooker, María Auxilio Osorio Lama: Mixed Logical-linear Programming. Discrete Applied Mathematics 96-97: 395-442 (1999) | |
| c5 | John N. Hooker, Greger Ottosson, Erlendur S. Thorsteinsson, Hak-Jin Kim: On Integrating Constraint Propagation and Linear Programming for Combinatorial Optimization. AAAI/IAAI 1999: 136-141 | |
| 1996 | ||
| j12 | John N. Hooker: Resolution and the integrality of satisfiability problems. Math. Program. 74: 1-10 (1996) | |
| c4 | ||
| 1995 | ||
| j11 | John N. Hooker, V. Vinay: Branching Rules for Satisfiability. J. Autom. Reasoning 15(3): 359-383 (1995) | |
| 1994 | ||
| j10 | John N. Hooker, Hong Yan, Ignacio E. Grossmann, Ramesh Raman: Logic cuts for processing networks with fixed charges. Computers & OR 21(3): 265-279 (1994) | |
| j9 | Farid Harche, John N. Hooker, Gerald L. Thompson: A Computational Study of Satisfiability Algorithms for Propositional Logic. INFORMS Journal on Computing 6(4): 423-435 (1994) | |
| j8 | Endre Boros, Peter L. Hammer, John N. Hooker: Predicting Cause-Effect Relationships from Incomplete Discrete Observations. SIAM J. Discrete Math. 7(4): 531-543 (1994) | |
| c3 | John N. Hooker, V. Vinay: Branching Rules for Satisfiability (Extended Abstract). FSTTCS 1994: 426-437 | |
| c2 | ||
| 1993 | ||
| j7 | John N. Hooker: Solving the incremental satisfiability problem. J. Log. Program. 15(1&2): 177-186 (1993) | |
| 1992 | ||
| j6 | John N. Hooker: Generalized Resolution for 0-1 Linear Inequalities. Ann. Math. Artif. Intell. 6(1-3): 271-286 (1992) | |
| j5 | V. Chandru, John N. Hooker: Detecting Embedded Horn Structure in Propositional Logic. Inf. Process. Lett. 42(2): 109-111 (1992) | |
| 1991 | ||
| j4 | ||
| c1 | ||
| 1990 | ||
| j3 | John N. Hooker, C. Fedjiki: Branch-and-Cut Solution of Inference Problems in Propositional Logic. Ann. Math. Artif. Intell. 1: 123-139 (1990) | |
| 1989 | ||
| j2 | John N. Hooker: Input Proofs and Rank One Cutting Planes. INFORMS Journal on Computing 1(3): 137-145 (1989) | |
| 1988 | ||
| j1 | ||
Colors in the list of coauthors
Last update Sun May 26 00:00:11 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page