Year |
Citation |
Score |
2020 |
Benadè G, Hooker JN. Optimization Bounds from the Branching Dual Informs Journal On Computing. 32: 3-15. DOI: 10.1287/Ijoc.2018.0884 |
0.411 |
|
2020 |
Serra T, Hooker JN. Compact representation of near-optimal integer programming solutions Mathematical Programming. 182: 199-232. DOI: 10.1007/S10107-019-01390-3 |
0.373 |
|
2018 |
Hooker JN, Hoeve WJ. Constraint programming and operations research Constraints - An International Journal. 23: 172-195. DOI: 10.1007/S10601-017-9280-3 |
0.411 |
|
2016 |
Cire AA, Hooker JN, Yunes T. Modeling with metaconstraints and semantic typing of variables Informs Journal On Computing. 28: 1-13. DOI: 10.1287/Ijoc.2015.0664 |
0.371 |
|
2016 |
Bergman D, Cire AA, Van Hoeve WJ, Hooker JN. Discrete optimization with decision diagrams Informs Journal On Computing. 28: 47-66. DOI: 10.1287/Ijoc.2015.0648 |
0.455 |
|
2016 |
Ciré AA, Coban E, Hooker JN. Logic-based Benders decomposition for planning and scheduling: a computational analysis Knowledge Engineering Review. 31: 440-451. DOI: 10.1017/S0269888916000254 |
0.42 |
|
2016 |
Williams HP, Hooker JN. Integer Programming as Projection Discrete Optimization. 22: 291-311. DOI: 10.1016/J.Disopt.2016.08.004 |
0.322 |
|
2016 |
Hooker JN. Projection, consistency, and George Boole Constraints. 21: 59-76. DOI: 10.1007/S10601-015-9201-2 |
0.384 |
|
2016 |
Coban E, Heching A, Hooker JN, Scheller-Wolf A. Robust Scheduling with Logic-Based Benders Decomposition A Quarterly Journal of Operations Research. 99-105. DOI: 10.1007/978-3-319-28697-6_15 |
0.384 |
|
2015 |
Hooker JN. Toward unification of exact and heuristic optimization methods International Transactions in Operational Research. 22: 19-48. DOI: 10.1111/Itor.12020 |
0.394 |
|
2014 |
Peterson B, Harjunkoski I, Hoda S, Hooker JN. Scheduling multiple factory cranes on a common track Computers and Operations Research. 48: 102-112. DOI: 10.1016/J.Cor.2014.03.005 |
0.33 |
|
2014 |
Harjunkoski I, Maravelias CT, Bongers P, Castro PM, Engell S, Grossmann IE, Hooker J, Méndez C, Sand G, Wassick J. Scope for industrial applications of production scheduling models and solution methods Computers and Chemical Engineering. 62: 161-193. DOI: 10.1016/J.Compchemeng.2013.12.001 |
0.324 |
|
2014 |
Bergman D, Hooker JN. Graph coloring inequalities from all-different systems Constraints. 19: 404-433. DOI: 10.1007/S10601-014-9164-8 |
0.377 |
|
2013 |
Coban E, Hooker JN. Single-facility scheduling by logic-based Benders decomposition Annals of Operations Research. 210: 245-272. DOI: 10.1007/S10479-011-1031-Z |
0.423 |
|
2012 |
Hooker JN, Williams HP. Combining equity and utilitarianism in a mathematical programming model Management Science. 58: 1682-1693. DOI: 10.1287/Mnsc.1120.1515 |
0.417 |
|
2011 |
Hooker JN. Integrated Methods for Optimization Operations Research and Management Science. 170. DOI: 10.1007/978-1-4614-1900-6 |
0.414 |
|
2010 |
Yunes T, Aron ID, Hooker JN. An integrated solver for optimization problems Operations Research. 58: 342-356. DOI: 10.1287/Opre.1090.0733 |
0.421 |
|
2008 |
Salman S, Ravi R, Hooker JN. Solving the capacitated local access network design problem Informs Journal On Computing. 20: 243-254. DOI: 10.1287/Ijoc.1070.0237 |
0.381 |
|
2007 |
Hooker JN. Planning and scheduling by logic-based benders decomposition Operations Research. 55: 588-602. DOI: 10.1287/Opre.1060.0371 |
0.428 |
|
2007 |
Hooker JN. A framework for integrating optimization and constraint programming Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4612: 4. |
0.308 |
|
2006 |
Hooker JN. An integrated method for planning and scheduling to minimize tardiness Constraints. 11: 139-157. DOI: 10.1007/S10601-006-8060-2 |
0.396 |
|
2005 |
Hooker JN. A hybrid method for the planning and scheduling Constraints. 10: 385-401. DOI: 10.1007/S10601-005-2812-2 |
0.392 |
|
2005 |
Hooker JN. Convex programming methods for global optimization Lecture Notes in Computer Science. 3478: 46-60. DOI: 10.1007/11425076_4 |
0.425 |
|
2003 |
Hooker JN, Ottosson G. Logic-based Benders decomposition Mathematical Programming, Series B. 96: 33-60. DOI: 10.1007/S10107-003-0375-9 |
0.437 |
|
2002 |
Hooker JN. Logic, Optimization, and Constraint Programming Informs Journal On Computing. 14: 295-321. DOI: 10.1287/Ijoc.14.4.295.2828 |
0.367 |
|
2002 |
Kim HJ, Hooker JN. Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach Annals of Operations Research. 115: 95-124. DOI: 10.1023/A:1021145103592 |
0.422 |
|
2002 |
Hooker JN, Rago G, Chandru V, Shrivastava A. Partial instantiation methods for inference in first-order logic Journal of Automated Reasoning. 28: 371-396. DOI: 10.1023/A:1015854101244 |
0.405 |
|
2001 |
Bollapragada S, Ghattas O, Hooker JN. Optimal design of truss structures by logic-based branch and cut Operations Research. 49: 42-51. DOI: 10.1287/Opre.49.1.42.11196 |
0.421 |
|
2001 |
Hooker JN, Kim HJ, Ottosson G. A Declarative Modeling Framework that Integrates Solution Methods Annals of Operations Research. 104: 141-161. DOI: 10.1023/A:1013195004424 |
0.408 |
|
2000 |
Dawande MW, Hooker JN. Inference-based sensitivity analysis for mixed integer/linear programming Operations Research. 48: 623-634. DOI: 10.1287/Opre.48.4.623.12420 |
0.443 |
|
2000 |
Hooker J, Ottosson G, Thorsteinsson ES, Kim H. A scheme for unifying optimization and constraint satisfaction methods Knowledge Engineering Review. 15: 11-30. DOI: 10.1017/S0269888900001077 |
0.359 |
|
2000 |
Ottosson G, Thorsteinsson ES, Hooker JN. Mixed global constraints and inference in hybrid CLP-IP solvers Electronic Notes in Discrete Mathematics. 4: 1-22. DOI: 10.1016/S1571-0653(05)80104-0 |
0.393 |
|
1999 |
Hooker JN, Osorio MA. Mixed logical-linear programming Discrete Applied Mathematics. 96: 395-442. DOI: 10.1016/S0166-218X(99)00100-6 |
0.392 |
|
1997 |
Cagan J, Grossmann IE, Hooker J. A conceptual framework for combining artificial intelligence and optimization in engineering design Research in Engineering Design. 9: 20-34. DOI: 10.1007/Bf01607055 |
0.331 |
|
1996 |
Hooker JN. Inference duality as a basis for sensitivity analysis Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1118: 224-236. DOI: 10.1023/A:1009838725226 |
0.442 |
|
1996 |
Hooker JN. Resolution and the integrality of satisfiability problems Mathematical Programming, Series B. 74: 1-10. DOI: 10.1007/Bf02592142 |
0.395 |
|
1996 |
Andersen KA, Hooker JN. Determining lower and upper bounds on probabilities of atomic propositions in sets of logical formulas represented by digraphs Annals of Operations Research. 65: 1-20. DOI: 10.1007/Bf02187324 |
0.306 |
|
1995 |
Hooker JN, Natraj NR. Solving a General Routing and Scheduling Problem by Chain Decomposition and Tabu Search Transportation Science. 29: 30-44. DOI: 10.1287/Trsc.29.1.30 |
0.401 |
|
1995 |
Hooker JN. Testing heuristics: We have it all wrong Journal of Heuristics. 1: 33-42. DOI: 10.1007/Bf02430364 |
0.341 |
|
1995 |
Hooker JN, Vinay V. Branching rules for satisfiability Journal of Automated Reasoning. 15: 359-383. DOI: 10.1007/Bf00881805 |
0.338 |
|
1994 |
Harche F, Hooker JN, Thompson GL. A Computational Study of Satisfiability Algorithms for Propositional Logic Informs Journal On Computing. 6: 423-435. DOI: 10.1287/Ijoc.6.4.423 |
0.386 |
|
1994 |
Boros E, Hammer PL, Hooker JN. Predicting Cause-Effect Relationships from Incomplete Discrete Observations Siam Journal On Discrete Mathematics. 7: 531-543. DOI: 10.1137/S0895480191199385 |
0.349 |
|
1994 |
Hooker JN, Yan H, Grossmann IE, Raman R. Logic cuts for processing networks with fixed charges Computers and Operations Research. 21: 265-279. DOI: 10.1016/0305-0548(94)90089-2 |
0.371 |
|
1993 |
Hooker JN. Solving the incremental satisfiability problem The Journal of Logic Programming. 15: 177-186. DOI: 10.1016/0743-1066(93)90018-C |
0.394 |
|
1993 |
Hooker JN. New methods for computing inferences in first order logic Annals of Operations Research. 43: 477-492. DOI: 10.1007/Bf02027814 |
0.319 |
|
1992 |
Chandru V, Hooker JN. Detecting embedded Horn structure in propositional logic Information Processing Letters. 42: 109-111. DOI: 10.1016/0020-0190(92)90098-G |
0.403 |
|
1992 |
Hooker JN. Generalized resolution for 0-1 linear inequalities Annals of Mathematics and Artificial Intelligence. 6: 271-286. DOI: 10.1007/Bf01531033 |
0.388 |
|
1991 |
Hooker JN, Garfinkel RS, Chen CK. Finite dominating sets for network location problems Operations Research. 39: 100-118. DOI: 10.1287/Opre.39.1.100 |
0.363 |
|
1991 |
Chandru V, Hooker JN. Extended Horn Sets in Propositional Logic Journal of the Acm (Jacm). 38: 205-221. DOI: 10.1145/102782.102789 |
0.35 |
|
1990 |
Hooker JN, Fedjki C. Branch-and-cut solution of inference problems in propositional logic Annals of Mathematics and Artificial Intelligence. 1: 123-139. DOI: 10.1007/Bf01531074 |
0.44 |
|
1989 |
Hooker JN. Solving nonlinear multiple-facility network location problems Networks. 19: 117-133. DOI: 10.1002/Net.3230190110 |
0.389 |
|
1988 |
Hooker JN. Resolution vs. cutting plane solution of inference problems: Some computational experience Operations Research Letters. 7: 1-7. DOI: 10.1016/0167-6377(88)90044-2 |
0.423 |
|
1988 |
Hooker JN. Generalized resolution and cutting planes Annals of Operations Research. 12: 217-239. DOI: 10.1007/Bf02186368 |
0.37 |
|
1986 |
Hooker J. Solving nonlinear single-facility network location problems Operations Research. 34: 732-743. DOI: 10.1287/Opre.34.5.732 |
0.371 |
|
1986 |
Hooker JN. KARMARKAR'S LINEAR PROGRAMMING ALGORITHM Interfaces. 16: 75-90. DOI: 10.1287/Inte.16.4.75 |
0.337 |
|
1983 |
Hooker JN. OPTIMAL CONTROL OF AUTOMOBILES FOR FUEL ECONOMY Transportation Science. 17: 146-167. DOI: 10.1287/Trsc.17.2.146 |
0.306 |
|
Show low-probability matches. |