| 2009 |
|---|
| 43 | EE | John N. Hooker:
Integer Programming Duality.
Encyclopedia of Optimization 2009: 1657-1667 |
| 42 | EE | John N. Hooker:
Integer Programming: Lagrangian Relaxation.
Encyclopedia of Optimization 2009: 1667-1673 |
| 2008 |
|---|
| 41 | EE | Tarik Hadzic,
John N. Hooker,
Barry O'Sullivan,
Peter Tiedemann:
Approximate Compilation of Constraints into Multivalued Decision Diagrams.
CP 2008: 448-462 |
| 40 | EE | Tarik Hadzic,
John N. Hooker,
Peter Tiedemann:
Propagating Separable Equalities in an MDD Store.
CPAIOR 2008: 318-322 |
| 39 | EE | 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) |
| 2007 |
|---|
| 38 | EE | Henrik Reif Andersen,
Tarik Hadzic,
John N. Hooker,
Peter Tiedemann:
A Constraint Store Based on Multivalued Decision Diagrams.
CP 2007: 118-132 |
| 37 | EE | Tarik Hadzic,
John N. Hooker:
Cost-Bounded Binary Decision Diagrams for 0-1 Programming.
CPAIOR 2007: 84-98 |
| 36 | EE | John N. Hooker:
A Framework for Integrating Optimization and Constraint Programming.
SARA 2007: 4 |
| 2006 |
|---|
| 35 | EE | Latife Genç Kaya,
John N. Hooker:
A Filter for the Circuit Constraint.
CP 2006: 706-710 |
| 34 | EE | John N. Hooker:
Duality in Optimization and Constraint Satisfaction.
CPAIOR 2006: 3-15 |
| 33 | EE | John N. Hooker:
An Integrated Method for Planning and Scheduling to Minimize Tardiness.
Constraints 11(2-3): 139-157 (2006) |
| 2005 |
|---|
| 32 | EE | John N. Hooker:
Planning and Scheduling to Minimize Tardiness.
CP 2005: 314-327 |
| 31 | EE | Latife Genç Kaya,
John N. Hooker:
Domain Reduction for the Circuit Constraint.
CP 2005: 846 |
| 30 | EE | John N. Hooker:
A Search-Infer-and-Relax Framework for Integrating Solution Methods.
CPAIOR 2005: 243-257 |
| 29 | EE | John N. Hooker:
A Hybrid Method for the Planning and Scheduling.
Constraints 10(4): 385-401 (2005) |
| 2004 |
|---|
| 28 | EE | John N. Hooker:
A Hybrid Method for Planning and Scheduling.
CP 2004: 305-316 |
| 27 | EE | Ionut D. Aron,
John N. Hooker,
Tallys H. Yunes:
SIMPL: A System for Integrating Optimization Techniques.
CPAIOR 2004: 21-36 |
| 2003 |
|---|
| 26 | EE | John N. Hooker:
Convex Programming Methods for Global Optimization.
COCOS 2003: 46-60 |
| 2002 |
|---|
| 25 | EE | John N. Hooker,
Hong Yan:
A Relaxation of the Cumulative Constraint.
CP 2002: 686-690 |
| 24 | | 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) |
| 23 | EE | 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) |
| 22 | EE | Giorgio C. Buttazzo,
Avi Efrati,
John N. Hooker,
Claude Le Pape,
Joseph Sifakis:
Abstracts of Invited Talks.
Electr. Notes Theor. Comput. Sci. 65(6): (2002) |
| 21 | EE | John N. Hooker:
Logic, Optimization, and Constraint Programming.
INFORMS Journal on Computing 14(4): 295-321 (2002) |
| 20 | | 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) |
| 2001 |
|---|
| 19 | EE | 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 |
|---|
| 18 | EE | 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 |
|---|
| 17 | | 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 |
| 16 | | John N. Hooker:
Inference Duality as a Basis for Sensitivity Analysis.
Constraints 4(2): 101-112 (1999) |
| 15 | EE | John N. Hooker,
María Auxilio Osorio Lama:
Mixed Logical-linear Programming.
Discrete Applied Mathematics 96-97: 395-442 (1999) |
| 1996 |
|---|
| 14 | | John N. Hooker:
Inference Duality as a Basis for Secitivity Analysis.
CP 1996: 224-236 |
| 13 | | John N. Hooker:
Resolution and the integrality of satisfiability problems.
Math. Program. 74: 1-10 (1996) |
| 1995 |
|---|
| 12 | | John N. Hooker,
V. Vinay:
Branching Rules for Satisfiability.
J. Autom. Reasoning 15(3): 359-383 (1995) |
| 1994 |
|---|
| 11 | | John N. Hooker,
V. Vinay:
Branching Rules for Satisfiability (Extended Abstract).
FSTTCS 1994: 426-437 |
| 10 | | John N. Hooker:
Logic-Based Methods for Optimization.
PPCP 1994: 336-349 |
| 9 | EE | John N. Hooker,
Hong Yan,
Ignacio E. Grossmann,
R. Raman:
Logic cuts for processing networks with fixed charges.
Computers & OR 21(3): 265-279 (1994) |
| 8 | EE | 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) |
| 1993 |
|---|
| 7 | | John N. Hooker:
Solving the incremental satisfiability problem.
J. Log. Program. 15(1&2): 177-186 (1993) |
| 1992 |
|---|
| 6 | | John N. Hooker:
Generalized Resolution for 0-1 Linear Inequalities.
Ann. Math. Artif. Intell. 6(1-3): 271-286 (1992) |
| 5 | | V. Chandru,
John N. Hooker:
Detecting Embedded Horn Structure in Propositional Logic.
Inf. Process. Lett. 42(2): 109-111 (1992) |
| 1991 |
|---|
| 4 | | John N. Hooker:
Logical Inference and Polyhedral Projection.
CSL 1991: 184-200 |
| 3 | EE | V. Chandru,
John N. Hooker:
Extended Horn Sets In Propositional Logic.
J. ACM 38(1): 205-221 (1991) |
| 1990 |
|---|
| 2 | | John N. Hooker,
C. Fedjiki:
Branch-and-Cut Solution of Inference Problems in Propositional Logic.
Ann. Math. Artif. Intell. 1: (1990) |
| 1988 |
|---|
| 1 | EE | John N. Hooker:
Networklike metric spaces.
Discrete Mathematics 68(1): 31-43 (1988) |
