| Year |
Citation |
Score |
| 2020 |
Karabulut E, Ahmed S, Nemhauser G. Decentralized algorithms for distributed integer programming problems with a coupling cardinality constraint Discrete Optimization. 38: 100595. DOI: 10.1016/J.Disopt.2020.100595 |
0.658 |
|
| 2020 |
Siebert M, Ahmed S, Nemhauser GL. A linear programming based approach to the Steiner tree problem with a fixed number of terminals Networks. 75: 124-136. DOI: 10.1002/Net.21913 |
0.63 |
|
| 2019 |
Munguía L, Ahmed S, Bader DA, Nemhauser GL, Shao Y, Papageorgiou DJ. Tailoring parallel alternating criteria search for domain specific MIPs: Application to maritime inventory routing Computers & Operations Research. 111: 21-34. DOI: 10.1016/J.Cor.2019.05.031 |
0.631 |
|
| 2018 |
Siebert M, Bartlett K, Kim H, Ahmed S, Lee J, Nazzal D, Nemhauser G, Sokol J. Lot targeting and lot dispatching decision policies for semiconductor manufacturing: optimisation under uncertainty with simulation validation International Journal of Production Research. 56: 629-641. DOI: 10.1080/00207543.2017.1387679 |
0.49 |
|
| 2018 |
Zhang C, Nemhauser G, Sokol J, Cheon M, Keha A. Flexible solutions to maritime inventory routing problems with delivery time windows Computers & Operations Research. 89: 153-162. DOI: 10.1016/J.Cor.2017.08.011 |
0.786 |
|
| 2018 |
Munguía L, Ahmed S, Bader DA, Nemhauser GL, Shao Y. Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs Computational Optimization and Applications. 69: 1-24. DOI: 10.1007/S10589-017-9934-5 |
0.617 |
|
| 2017 |
Andrade CEd, Ahmed S, Nemhauser GL, Shao Y. A hybrid primal heuristic for finding feasible solutions to mixed integer programs European Journal of Operational Research. 263: 62-71. DOI: 10.1016/J.Ejor.2017.05.003 |
0.591 |
|
| 2017 |
Munguía LM, Ahmed S, Bader DA, Nemhauser GL, Goel V, Shao Y. A parallel local search framework for the Fixed-Charge Multicommodity Network Flow problem Computers and Operations Research. 77: 44-57. DOI: 10.1016/J.Cor.2016.07.016 |
0.631 |
|
| 2017 |
Dilkina B, Khalil EB, Nemhauser GL. Comments on: On learning and branching: a survey Top. 25: 242-246. DOI: 10.1007/S11750-017-0454-3 |
0.455 |
|
| 2017 |
Bodic PL, Nemhauser GL. Erratum to: An abstract model for branching and its application to mixed integer programming Mathematical Programming. 166: 407-407. DOI: 10.1007/S10107-017-1118-7 |
0.382 |
|
| 2017 |
Bodic PL, Nemhauser GL. An Abstract Model for Branching and its Application to Mixed Integer Programming Mathematical Programming. 166: 369-405. DOI: 10.1007/S10107-016-1101-8 |
0.435 |
|
| 2016 |
Ahmed S, He Q, Li S, Nemhauser GL. On the computational complexity of minimum-concave-cost flow in a two-dimensional grid Siam Journal On Optimization. 26: 2059-2079. DOI: 10.1137/15M1045715 |
0.566 |
|
| 2015 |
Papageorgiou DJ, Cheon MS, Nemhauser G, Sokol J. Approximate dynamic programming for a class of long-horizon maritime inventory routing problems Transportation Science. 49: 870-885. DOI: 10.1287/Trsc.2014.0542 |
0.532 |
|
| 2015 |
Li Y, Ergun O, Nemhauser GL. A dual heuristic for mixed integer programming Operations Research Letters. 43: 411-417. DOI: 10.1016/J.Orl.2015.05.007 |
0.519 |
|
| 2015 |
Le Bodic P, Nemhauser GL. How important are branching decisions: Fooling MIP solvers Operations Research Letters. 43: 273-278. DOI: 10.1016/J.Orl.2015.03.003 |
0.444 |
|
| 2015 |
He Q, Ahmed S, Nemhauser GL. Minimum concave cost flow over a grid network Mathematical Programming. 150: 79-98. DOI: 10.1007/S10107-014-0752-6 |
0.642 |
|
| 2014 |
Papageorgiou DJ, Keha AB, Nemhauser GL, Sokol J. Two-stage decomposition algorithms for single product maritime inventory routing Informs Journal On Computing. 26: 825-847. DOI: 10.1287/Ijoc.2014.0601 |
0.797 |
|
| 2014 |
Carvajal R, Ahmed S, Nemhauser G, Furman K, Goel V, Shao Y. Using diversification, communication and parallelism to solve mixed-integer linear programs Operations Research Letters. 42: 186-189. DOI: 10.1016/J.Orl.2013.12.012 |
0.647 |
|
| 2014 |
Papageorgiou DJ, Nemhauser GL, Sokol J, Cheon MS, Keha AB. MIRPLib - A library of maritime inventory routing problem instances: Survey, core model, and benchmark results European Journal of Operational Research. 235: 350-366. DOI: 10.1016/J.Ejor.2013.12.013 |
0.823 |
|
| 2014 |
Bartlett K, Lee J, Ahmed S, Nemhauser G, Sokol J, Na B. Congestion-aware dynamic routing in automated material handling systems Computers and Industrial Engineering. 70: 176-182. DOI: 10.1016/J.Cie.2014.02.002 |
0.481 |
|
| 2014 |
Na B, Ahmed S, Nemhauser G, Sokol J. A cutting and scheduling problem in float glass manufacturing Journal of Scheduling. 17: 95-107. DOI: 10.1007/S10951-013-0335-Z |
0.638 |
|
| 2013 |
Bartlett K, Nemhauser G, Sokol J, Dilbeck J. Optimizing Recruiting Asset Allocation and Routing with Integer Programming Military Operations Research. 18: 5-13. DOI: 10.5711/1082598318205 |
0.422 |
|
| 2013 |
Hewitt M, Nemhauser G, Savelsbergh MWP. Branch-and-Price Guided Search for Integer Programs with an Application to the Multicommodity Fixed-Charge Network Flow Problem Informs Journal On Computing. 25: 302-316. DOI: 10.1287/Ijoc.1120.0503 |
0.759 |
|
| 2013 |
Na B, Ahmed S, Nemhauser G, Sokol J. Optimization of automated float glass lines International Journal of Production Economics. 145: 561-572. DOI: 10.1016/J.Ijpe.2013.04.024 |
0.602 |
|
| 2013 |
Hewitt M, Nemhauser G, Savelsbergh M, Song J. A branch-and-price guided search approach to maritime inventory routing Computers & Operations Research. 40: 1410-1419. DOI: 10.1016/J.Cor.2012.09.010 |
0.809 |
|
| 2012 |
Papageorgiou DJ, Toriello A, Nemhauser GL, Savelsbergh MWP. Fixed-charge transportation with product blending Transportation Science. 46: 281-295. DOI: 10.1287/Trsc.1110.0381 |
0.467 |
|
| 2012 |
Engineer FG, Furman KC, Nemhauser GL, Savelsbergh MWP, Song JH. A branch-price-and-cut algorithm for single-product maritime inventory routing Operations Research. 60: 106-122. DOI: 10.1287/Opre.1110.0997 |
0.832 |
|
| 2012 |
Engineer FG, Nemhauser GL, Savelsbergh MWP, Song JH. The fixed-charge shortest-path problem Informs Journal On Computing. 24: 578-596. DOI: 10.1287/Ijoc.1110.0469 |
0.816 |
|
| 2012 |
Vielma JP, Ahmed S, Nemhauser GL. Mixed integer linear programming formulations for probabilistic constraints Operations Research Letters. 40: 153-158. DOI: 10.1016/J.Orl.2012.01.007 |
0.62 |
|
| 2012 |
He Q, Ahmed S, Nemhauser GL. Sell or Hold: A simple two-stage stochastic combinatorial optimization problem Operations Research Letters. 40: 69-73. DOI: 10.1016/J.Orl.2011.11.007 |
0.559 |
|
| 2012 |
Toriello A, Nemhauser G. The value function of an infinite-horizon single-item lot-sizing problem Operations Research Letters. 40: 12-14. DOI: 10.1016/J.Orl.2011.10.014 |
0.39 |
|
| 2012 |
Li Y, Nemhauser G, Savelsbergh M. Pricing for production and delivery flexibility in single-item lot-sizing Computers & Operations Research. 39: 3408-3419. DOI: 10.1016/J.Cor.2012.05.003 |
0.711 |
|
| 2012 |
Hewitt M, Nemhauser GL, Savelsbergh M. Branch-and-price guided search Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7422: 15-18. DOI: 10.1007/978-3-642-32147-4_2 |
0.343 |
|
| 2011 |
Narisetty AK, Richard JPP, Nemhauser GL. Lifted tableaux inequalities for 0-1 mixed-integer programs: A computational study Informs Journal On Computing. 23: 416-424. DOI: 10.1287/Ijoc.1100.0413 |
0.465 |
|
| 2011 |
Engineer FG, Nemhauser GL, Savelsbergh MWP. Dynamic programming-based column generation on time-expanded networks: Application to the dial-a-flight problem Informs Journal On Computing. 23: 105-119. DOI: 10.1287/Ijoc.1100.0384 |
0.831 |
|
| 2011 |
He Q, Ahmed S, Nemhauser GL. A probabilistic comparison of split and type 1 triangle cuts for two-row mixed-integer programs Siam Journal On Optimization. 21: 617-632. DOI: 10.1137/100797254 |
0.578 |
|
| 2010 |
Keysan G, Nemhauser GL, Savelsbergh MWP. Tactical and operational planning of scheduled maintenance for per-seat, on-demand air transportation Transportation Science. 44: 291-306. DOI: 10.1287/Trsc.1090.0311 |
0.767 |
|
| 2010 |
Vielma JP, Ahmed S, Nemhauser G. Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions Operations Research. 58: 303-315. DOI: 10.1287/Opre.1090.0721 |
0.614 |
|
| 2010 |
Vielma JP, Ahmed S, Nemhauser G. A Note on “A Superior Representation Method for Piecewise Linear Functions” Informs Journal On Computing. 22: 493-497. DOI: 10.1287/Ijoc.1100.0379 |
0.553 |
|
| 2010 |
Hewitt M, Nemhauser GL, Savelsbergh MWP. Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem Informs Journal On Computing. 22: 314-325. DOI: 10.1287/Ijoc.1090.0348 |
0.735 |
|
| 2010 |
Luedtke J, Ahmed S, Nemhauser GL. An integer programming approach for linear programs with probabilistic constraints Mathematical Programming. 122: 247-272. DOI: 10.1007/S10107-008-0247-4 |
0.813 |
|
| 2010 |
Jünger M, Naddef D, Pulleyblank WR, Rinaldi G, Liebling TM, Nemhauser GL, Reinelt G, Wolsey LA. 50 years of integer programming 1958-2008: From the early years to the state-of-the-art 50 Years of Integer Programming 1958-2008: From the Early Years to the State-of-the-Art. 1-804. DOI: 10.1007/978-3-540-68279-0 |
0.315 |
|
| 2010 |
Toriello A, Nemhauser G, Savelsbergh M. Decomposing inventory routing problems with approximate value functions Naval Research Logistics. 57: 718-727. DOI: 10.1002/Nav.20433 |
0.742 |
|
| 2009 |
Luedtke J, Nemhauser GL. Strategic planning with start-time dependent variable costs Operations Research. 57: 1250-1261. DOI: 10.1287/Opre.1080.0649 |
0.769 |
|
| 2009 |
Guan Y, Ahmed S, Nemhauser GL. Cutting planes for multistage stochastic integer programs Operations Research. 57: 287-298. DOI: 10.1287/Opre.1080.0535 |
0.664 |
|
| 2009 |
Kilinç-Karzan F, Toriello A, Ahmed S, Nemhauser G, Savelsbergh M. Approximating the stability region for binary mixed-integer programs Operations Research Letters. 37: 250-254. DOI: 10.1016/J.Orl.2009.04.001 |
0.757 |
|
| 2009 |
Karzan FK, Nemhauser GL, Savelsbergh MWP. Information-based branching schemes for binary linear mixed integer problems Mathematical Programming Computation. 1: 249-293. DOI: 10.1007/S12532-009-0009-1 |
0.432 |
|
| 2008 |
Espinoza D, Garcia R, Goycoolea M, Nemhauser GL, Savelsbergh MWP. Per-seat, on-demand air transportation Part II: Parallel local search Transportation Science. 42: 279-291. DOI: 10.1287/Trsc.1070.0228 |
0.379 |
|
| 2008 |
Espinoza D, Garcia R, Goycoolea M, Nemhauser GL, Savelsbergh MWP. Per-seat, on-demand air transportation Part I: problem description and an integer multicommodity flow model Transportation Science. 42: 263-278. DOI: 10.1287/Trsc.1070.0227 |
0.42 |
|
| 2008 |
Vielma JP, Ahmed S, Nemhauser GL. A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs Informs Journal On Computing. 20: 438-450. DOI: 10.1287/ijoc.l070.0256 |
0.373 |
|
| 2008 |
Vielma JP, Ahmed S, Nemhauser GL. A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs Informs Journal On Computing. 20: 438-450. DOI: 10.1287/Ijoc.1070.0256 |
0.631 |
|
| 2008 |
Hardin JR, Nemhauser GL, Savelsbergh MWP. Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements Discrete Optimization. 5: 19-35. DOI: 10.1016/J.Disopt.2007.10.003 |
0.471 |
|
| 2008 |
Grötschel M, Nemhauser GL. George Dantzig's contributions to integer programming Discrete Optimization. 5: 168-173. DOI: 10.1016/J.Disopt.2007.08.003 |
0.403 |
|
| 2008 |
Vielma JP, Keha AB, Nemhauser GL. Nonconvex, lower semicontinuous piecewise linear optimization Discrete Optimization. 5: 467-488. DOI: 10.1016/J.Disopt.2007.07.001 |
0.804 |
|
| 2008 |
Vielma JP, Nemhauser GL. Modeling disjunctive constraints with a logarithmic number of binary variables and constraints Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5035: 199-213. DOI: 10.1007/S10107-009-0295-4 |
0.426 |
|
| 2007 |
Guan Y, Ahmed S, Nemhauser GL. Sequential pairing of mixed integer inequalities Discrete Optimization. 4: 21-39. DOI: 10.1016/J.Disopt.2006.10.003 |
0.588 |
|
| 2007 |
Hardin JR, Nemhauser GL, Savelsbergh MWP. Analysis of bounds for a capacitated single-item lot-sizing problem Computers and Operations Research. 34: 1721-1743. DOI: 10.1016/J.Cor.2005.05.031 |
0.488 |
|
| 2006 |
Keha AB, De Farias IR, Nemhauser GL. A branch-and-cut algorithm without binary variables for nonconvex piecewise linear optimization Operations Research. 54: 847-858. DOI: 10.1287/Opre.1060.0277 |
0.823 |
|
| 2006 |
Guan Y, Ahmed S, Miller AJ, Nemhauser GL. On formulations of the stochastic uncapacitated lot-sizing problem Operations Research Letters. 34: 241-250. DOI: 10.1016/J.Orl.2005.05.004 |
0.608 |
|
| 2006 |
Chew EP, Huang HC, Johnson EL, Nemhauser GL, Sokol JS, Leong CH. Short-term booking of air cargo space European Journal of Operational Research. 174: 1979-1990. DOI: 10.1016/J.Ejor.2005.05.011 |
0.561 |
|
| 2006 |
Schaefer AJ, Nemhauser GL. Improving airline operational performance through schedule perturbation Annals of Operations Research. 144: 3-16. DOI: 10.1007/S10479-006-0003-1 |
0.36 |
|
| 2006 |
Guan Y, Ahmed S, Nemhauser GL, Miller AJ. A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem Mathematical Programming. 105: 55-84. DOI: 10.1007/S10107-005-0572-9 |
0.635 |
|
| 2006 |
Ileri Y, Bazaraa M, Gifford T, Nemhauser G, Sokol J, Wikum E. An optimization approach for planning daily drayage operations Central European Journal of Operations Research. 14: 141-156. DOI: 10.1007/S10100-006-0165-6 |
0.794 |
|
| 2005 |
Schaefer AJ, Johnson EL, Kleywegt AJ, Nemhauser GL. Airline crew scheduling under uncertainty Transportation Science. 39: 340-348. DOI: 10.1287/Trsc.1040.0091 |
0.609 |
|
| 2005 |
Vandenbussche D, Nemhauser GL. The 2-edge-connected subgraph polyhedron Journal of Combinatorial Optimization. 9: 357-379. DOI: 10.1007/S10878-005-1777-9 |
0.77 |
|
| 2005 |
Vandenbussche D, Nemhauser GL. A branch-and-cut algorithm for nonconvex quadratic programs with box constraints Mathematical Programming. 102: 559-575. DOI: 10.1007/S10107-004-0550-7 |
0.816 |
|
| 2005 |
Vandenbussche D, Nemhauser GL. A polyhedral study of nonconvex quadratic programs with box constraints Mathematical Programming. 102: 531-557. DOI: 10.1007/S10107-004-0549-0 |
0.82 |
|
| 2004 |
Rosenberger JM, Johnson EL, Nemhauser GL. A robust fleet-assignment model with hub isolation and short cycles Transportation Science. 38: 357-368. DOI: 10.1287/Trsc.1030.0038 |
0.728 |
|
| 2004 |
Keha AB, De Farias IR, Nemhauser GL. Models for representing piecewise linear cost functions Operations Research Letters. 32: 44-48. DOI: 10.1016/S0167-6377(03)00059-2 |
0.795 |
|
| 2003 |
Rosenberger JM, Johnson EL, Nemhauser GL. Rerouting aircraft for airline recovery Transportation Science. 37: 408-421. DOI: 10.1287/Trsc.37.4.408.23271 |
0.739 |
|
| 2003 |
Verweij B, Ahmed S, Kleywegt AJ, Nemhauser G, Shapiro A. The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study Computational Optimization and Applications. 24: 289-333. DOI: 10.1023/A:1021814225969 |
0.639 |
|
| 2003 |
Richard JPP, De Farias IR, Nemhauser GL. Lifted inequalities for 0-1 mixed integer programming: Superlinear lifting Mathematical Programming. 98: 115-143. DOI: 10.1007/S10107-003-0399-1 |
0.776 |
|
| 2003 |
Richard JPP, De Farias IR, Nemhauser GL. Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms Mathematical Programming. 98: 89-113. DOI: 10.1007/S10107-003-0398-2 |
0.778 |
|
| 2003 |
Miller AJ, Nemhauser GL, Savelsbergh MWP. A multi-item production planning model with setup times: Algorithms, reformulations, and polyhedral characterizations for a special case Mathematical Programming, Series B. 95: 71-90. DOI: 10.1007/S10107-002-0340-Z |
0.48 |
|
| 2003 |
Miller AJ, Nemhauser GL, Savelsbergh MWP. On the polyhedral structure of a multi-item production planning model with setup times Mathematical Programming. 94: 375-405. DOI: 10.1007/S10107-002-0325-Y |
0.488 |
|
| 2003 |
Richard JP, Farias IRd, Nemhauser GL. A simplex-based algorithm for 0-1 mixed integer programming Lecture Notes in Computer Science. 2570: 158-170. DOI: 10.1007/3-540-36478-1_15 |
0.589 |
|
| 2003 |
Richard JPP, De Farias IR, Nemhauser GL. A simplex-based algorithm for 0-1 mixed integer programming Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2570: 158-170. |
0.77 |
|
| 2002 |
Rosenberger JM, Schaefer AJ, Goldsman D, Johnson EL, Kleywegt AJ, Nemhauser GL. A stochastic model of airline operations Transportation Science. 36: 357-377. DOI: 10.1287/Trsc.36.4.357.551 |
0.721 |
|
| 2002 |
Klabjan D, Johnson EL, Nemhauser GL, Gelman E, Ramaswamy S. Airline crew scheduling with time windows and plane-count constraints Transportation Science. 36: 337-348. DOI: 10.1287/Trsc.36.3.337.7831 |
0.762 |
|
| 2002 |
Klabjan D, Nemhauser GL. A polyhedral study of integer variable upper bounds Mathematics of Operations Research. 27: 711-739. DOI: 10.1287/Moor.27.4.711.300 |
0.67 |
|
| 2002 |
Farias IRd, Johnson EL, Nemhauser GL. Facets of the Complementarity Knapsack Polytope Mathematics of Operations Research. 27: 210-226. DOI: 10.1287/Moor.27.1.210.335 |
0.65 |
|
| 2002 |
Day J, Nemhauser GL, Sokol JS. Management of railroad impedances for shortest path-based routing Electronic Notes in Theoretical Computer Science. 66: 57-69. DOI: 10.1016/S1571-0661(04)80529-2 |
0.5 |
|
| 2002 |
De Farias IR, Nemhauser GL. A polyhedral study of the cardinality constrained knapsack problem Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2337: 291-303. DOI: 10.1007/S10107-003-0420-8 |
0.813 |
|
| 2002 |
De Farias IR, Nemhauser GL. A polyhedral study of the cardinality constrained knapsack problem Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2337: 291-303. |
0.803 |
|
| 2002 |
De Farias IR, Johnson EL, Nemhauser GL. Facets of the complementarity knapsack polytope Mathematics of Operations Research. 27: 210-226. |
0.786 |
|
| 2001 |
Klabjan D, Johnson EL, Nemhauser GL, Gelman E, Ramaswamy S. Airline crew scheduling with regularity Transportation Science. 35: 359-374. DOI: 10.1287/Trsc.35.4.359.10437 |
0.788 |
|
| 2001 |
Glockner GD, Nemhauser GL, Tovey CA. Dynamic network flow with uncertain arc capacities: Decomposition algorithm and computational results Computational Optimization and Applications. 18: 233-250. DOI: 10.1023/A:1011233219223 |
0.434 |
|
| 2001 |
Klabjan D, Johnson EL, Nemhauser GL, Gelman E, Ramaswamy S. Solving large airline crew scheduling problems: Random pairing generation and strong branching Computational Optimization and Applications. 20: 73-91. DOI: 10.1023/A:1011223523191 |
0.798 |
|
| 2001 |
De Farias IR, Johnson EL, Nemhauser GL. Branch-and-cut for combinatorial optimisation problems without auxiliary binary variables Knowledge Engineering Review. 16: 25-39. DOI: 10.1017/S0269888901000030 |
0.84 |
|
| 2001 |
De Farias IR, Nemhauser GL. A family of inequalities for the generalized assignment polytope Operations Research Letters. 29: 49-55. DOI: 10.1016/S0167-6377(01)00086-4 |
0.74 |
|
| 2001 |
Miller AJ, Nemhauser GL, Savelsbergh MWP. Facets, algorithms, and polyhedral characterizations for a multi-item production planning model with setup times Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2081: 318-332. |
0.424 |
|
| 2000 |
Lettovský L, Johnson EL, Nemhauser GL. Airline crew recovery Transportation Science. 34: 337-348. DOI: 10.1287/Trsc.34.4.337.12316 |
0.659 |
|
| 2000 |
Glockner GD, Nemhauser GL. Dynamic network flow problem with uncertain arc capacities: formulation and problem structure Operations Research. 48: 233-242. DOI: 10.1287/Opre.48.2.233.12384 |
0.466 |
|
| 2000 |
Johnson EL, Nemhauser GL, Savelsbergh MWP. Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition Informs Journal On Computing. 12: 2-23. DOI: 10.1287/Ijoc.12.1.2.11900 |
0.699 |
|
| 2000 |
Gu Z, Nemhauser GL, Savelsbergh MWP. Sequence Independent Lifting in Mixed Integer Programming Journal of Combinatorial Optimization. 4: 109-129. DOI: 10.1023/A:1009841107478 |
0.478 |
|
| 2000 |
Miller AJ, Nemhauser GL, Savelsbergh MWP. On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra European Journal of Operational Research. 125: 298-315. DOI: 10.1016/S0377-2217(99)00461-0 |
0.475 |
|
| 2000 |
Boland NL, Clarke LW, Nemhauser GL. The asymmetric traveling salesman problem with replenishment arcs European Journal of Operational Research. 123: 408-427. DOI: 10.1016/S0377-2217(99)00266-0 |
0.506 |
|
| 2000 |
Atamtürk A, Nemhauser GL, Savelsbergh MWP. Conflict graphs in solving integer programming problems European Journal of Operational Research. 121: 40-55. DOI: 10.1016/S0377-2217(99)00015-6 |
0.721 |
|
| 2000 |
Klabjan D, Johnson EL, Nemhauser GL. A parallel primal-dual simplex algorithm Operations Research Letters. 27: 47-55. DOI: 10.1016/S0167-6377(00)00017-1 |
0.757 |
|
| 2000 |
De Farias IR, Johnson EL, Nemhauser GL. A generalized assignment problem with special ordered sets: A polyhedral approach Mathematical Programming, Series B. 89: 187-203. DOI: 10.1007/s101070000185 |
0.789 |
|
| 2000 |
Atamtürk A, Nemhauser GL, Savelsbergh MWP. The mixed vertex packing problem Mathematical Programming, Series B. 89: 35-53. DOI: 10.1007/S101070000154 |
0.785 |
|
| 2000 |
Farias IRd, Johnson EL, Nemhauser GL. A generalized assignment problem with special ordered sets: a polyhedral approach Mathematical Programming. 89: 187-203. DOI: 10.1007/Pl00011392 |
0.652 |
|
| 2000 |
Johnson EL, Nemhauser GL, Savelsbergh MWP. Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition Informs Journal On Computing. 12: 2-23. |
0.467 |
|
| 2000 |
Klabjan D, Johnson EL, Nemhauser GL. Parallel primal-dual simplex algorithm Operations Research Letters. 27: 47-55. |
0.668 |
|
| 1999 |
Adelman D, Nemhauser GL. Price-directed control of remnant inventory systems Operations Research. 47: 889-898. DOI: 10.1287/Opre.47.6.889 |
0.337 |
|
| 1999 |
Adelman D, Nemhauser GL, Padron M, Stubbs R, Pandit R. Allocating Fibers in Cable Manufacturing Manufacturing & Service Operations Management. 1: 21-35. DOI: 10.1287/Msom.1.1.21 |
0.373 |
|
| 1999 |
Gu Z, Nemhauser GL, Savelsbergh MWP. Lifted cover inequalities for 0-1 integer programs: Complexity Informs Journal On Computing. 11: 117-123. DOI: 10.1287/Ijoc.11.1.117 |
0.459 |
|
| 1999 |
Atamtürk A, Nemhauser GL, Savelsbergh MWP. Valid inequalities for problems with additive variable upper bounds Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1610: 60-72. DOI: 10.1007/S101070100235 |
0.754 |
|
| 1999 |
Gu Z, Nemhauser GL, Savelsbergh MWP. Lifted flow cover inequalities for mixed 0-1 integer programs Mathematical Programming, Series B. 85: 439-467. DOI: 10.1007/S101070050067 |
0.404 |
|
| 1998 |
Barnhart C, Boland NL, Clarke LW, Johnson EL, Nemhauser GL, Shenoi RG. Flight String Models for Aircraft Fleeting and Routing Transportation Science. 32: 208-220. DOI: 10.1287/Trsc.32.3.208 |
0.669 |
|
| 1998 |
Barnhart C, Boland NL, Clarke LW, Johnson EL, Nemhauser GL, Shenoi RG, Humphries M. For the Common Good? New Zealanders Comply with Quality Standards Organization Science. 9: 737-749. DOI: 10.1287/Orsc.9.6.737 |
0.49 |
|
| 1998 |
Barnhart C, Johnson EL, Nemhauser GL, Savelsbergh MWP, Vance PH. Branch-And-Price: Column Generation for Solving Huge Integer Programs Operations Research. 46: 316-329. DOI: 10.1287/Opre.46.3.316 |
0.677 |
|
| 1998 |
Mehrotra A, Johnson EL, Nemhauser GL. An optimization based heuristic for political districting Management Science. 44: 1100-1114. DOI: 10.1287/Mnsc.44.8.1100 |
0.628 |
|
| 1998 |
Klabjan D, Nemhauser G, Tovey C. The complexity of cover inequality separation Operations Research Letters. 23: 35-40. DOI: 10.1016/S0167-6377(98)00025-X |
0.699 |
|
| 1998 |
Barnhart C, Johnson EL, Nemhauser GL, Savelsbergh MWP, Vance PH. Branch-and-price: Column generation for solving huge integer programs Operations Research. 46: 316-329. |
0.427 |
|
| 1998 |
Gu Z, Nemhauser GL, Savelsbergh MWP. Lifted cover inequalities for 0-1 integer programs: Computation Informs Journal On Computing. 10: 427-437. |
0.381 |
|
| 1998 |
Klabjan D, Nemhauser GL, Tovey C. The complexity of cover inequality separation Operations Research Letters. 23: 35-40. |
0.653 |
|
| 1998 |
Barnhart C, Boland NL, Clarke LW, Johnson EL, Nemhauser GL, Shenoi RG. Flight string models for aircraft fleeting and routing Transportation Science. 32: 208-220. |
0.413 |
|
| 1998 |
Nemhauser GL, Trick MA. Scheduling a major college basketball conference Operations Research. 46: 1-8. |
0.329 |
|
| 1997 |
Vance PH, Barnhart C, Johnson EL, Nemhauser GL. Airline crew scheduling: A new formulation and decomposition algorithm Operations Research. 45: 188-200. DOI: 10.1287/Opre.45.2.188 |
0.687 |
|
| 1997 |
Clarke LW, Johnson EL, Nemhauser GL, Zhu Z. The Aircraft Rotation Problem. Annals of Operations Research. 69: 33-46. DOI: 10.1023/A:1018945415148 |
0.642 |
|
| 1996 |
Loerch AG, Boland N, Johnson EL, Nemhauser GL. Finding an Optimal Stationing Policy for the US Army in Europe After the Force Drawdown Military Operations Research. 2. DOI: 10.5711/Morj.2.4.39 |
0.507 |
|
| 1996 |
Clarke LW, Hane CA, Johnson EL, Nemhauser GL. Maintenance and crew considerations in fleet assignment Transportation Science. 30: 249-260. DOI: 10.1287/Trsc.30.3.249 |
0.824 |
|
| 1996 |
Lee H, Nemhauser GL, Wang Y. Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case European Journal of Operational Research. 94: 154-166. DOI: 10.1016/0377-2217(95)00205-7 |
0.52 |
|
| 1996 |
Atamtürk A, Nemhauser GL, Savelsbergh MWP. A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems Journal of Heuristics. 1: 247-259. DOI: 10.1007/Bf00127080 |
0.771 |
|
| 1996 |
Nemhauser GL. Branch-and-price for solving integer programs with a huge number of variables: Methods and applications Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1118: 570. DOI: 10.1007/3-540-61551-2_120 |
0.448 |
|
| 1995 |
Hane CA, Barnhart C, Johnson EL, Marsten RE, Nemhauser GL, Sigismondi G. The fleet assignment problem: Solving a large-scale integer program Mathematical Programming. 70: 211-232. DOI: 10.1007/Bf01585938 |
0.862 |
|
| 1995 |
Gu Z, Nemhauser GL, Savelsbergh MWP. Sequence independent lifting of cover inequalities Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 920: 452-461. |
0.304 |
|
| 1994 |
Nemhauser GL. The Age of Optimization: Solving Large-Scale Real-World Problems Operations Research. 42: 5-13. DOI: 10.1287/Opre.42.1.5 |
0.487 |
|
| 1994 |
Wikum ED, Llewellyn DC, Nemhauser GL. One-machine generalized precedence constrained scheduling problems Operations Research Letters. 16: 87-99. DOI: 10.1016/0167-6377(94)90064-7 |
0.468 |
|
| 1994 |
Nemhauser GL, Vance PH. Lifted cover facets of the 0-1 knapsack polytope with GUB constraints Operations Research Letters. 16: 255-263. DOI: 10.1016/0167-6377(94)90038-8 |
0.562 |
|
| 1994 |
Nemhauser GL, Savelsbergh MWP, Sigismondi GC. MINTO, a mixed INTeger optimizer Operations Research Letters. 15: 47-58. DOI: 10.1016/0167-6377(94)90013-2 |
0.533 |
|
| 1994 |
Gu Z, Johnson EL, Nemhauser GL, Yinhua W. Some properties of the fleet assignment problem Operations Research Letters. 15: 59-71. DOI: 10.1016/0167-6377(94)90001-9 |
0.654 |
|
| 1994 |
Vance PH, Barnhart C, Johnson EL, Nemhauser GL. Solving binary cutting stock problems by column generation and branch-and-bound Computational Optimization and Applications. 3: 111-130. DOI: 10.1007/Bf01300970 |
0.675 |
|
| 1993 |
Barnhart C, Johnson EL, Nemhauser GL, Sigismondi G, Vance P. Formulating a Mixed Integer Programming Problem to Improve Solvability Operations Research. 41: 1013-1019. DOI: 10.1287/Opre.41.6.1013 |
0.683 |
|
| 1993 |
Rushmeier RA, Nemhauser GL. Experiments with parallel branch-and-bound algorithms for the set covering problem Operations Research Letters. 13: 277-285. DOI: 10.1016/0167-6377(93)90050-Q |
0.508 |
|
| 1993 |
Johnson EL, Mehrotra A, Nemhauser GL. Min-cut clustering Mathematical Programming. 62: 133-151. DOI: 10.1007/Bf01585164 |
0.65 |
|
| 1992 |
Johnson EL, Nemhauser GL. Recent developments and future directions in mathematical programming Ibm Systems Journal. 31: 79-93. DOI: 10.1147/Sj.311.0079 |
0.657 |
|
| 1992 |
Nemhauser GL, Sigismondi G. A strong cutting plane/branch-and-bound algorithm for node packing Journal of the Operational Research Society. 43: 443-457. DOI: 10.1057/Jors.1992.71 |
0.353 |
|
| 1991 |
Aboudi R, Nemhauser GL. Some facets for an assignment problem with side constraints Operations Research. 39: 244-250. DOI: 10.1287/Opre.39.2.244 |
0.504 |
|
| 1991 |
Nemhauser GL, Park S. A polyhedral approach to edge coloring Operations Research Letters. 10: 315-322. DOI: 10.1016/0167-6377(91)90003-8 |
0.471 |
|
| 1990 |
Nemhauser GL, Wolsey LA. A recursive procedure to generate all cuts for 0-1 mixed integer programs Mathematical Programming. 46: 379-390. DOI: 10.1007/Bf01585752 |
0.422 |
|
| 1988 |
Pruul EA, Nemhauser GL, Rushmeier RA. Branch-and-bound and parallel computation: A historical note Operations Research Letters. 7: 65-69. DOI: 10.1016/0167-6377(88)90067-3 |
0.454 |
|
| 1986 |
Ikura Y, Nemhauser GL. Computational experience with a polynomial-time dual simplex algorithm for the transportation problem Discrete Applied Mathematics. 13: 239-248. DOI: 10.1016/0166-218X(86)90085-5 |
0.436 |
|
| 1985 |
Ikura Y, Nemhauser GL. Simplex pivots on the set packing polytope Mathematical Programming. 33: 123-138. DOI: 10.1007/Bf01582240 |
0.339 |
|
| 1984 |
Chang GJ, Nemhauser GL. The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs Siam Journal On Algebraic and Discrete Methods. 5: 332-345. DOI: 10.1137/0605034 |
0.346 |
|
| 1984 |
Grötschel M, Nemhauser GL. A polynomial algorithm for the max-cut problem on graphs without long odd cycles Mathematical Programming. 29: 28-40. DOI: 10.1007/Bf02591727 |
0.368 |
|
| 1982 |
Ikura Y, Nemhauser GL. An Efficient Primal Simplex Algorithm for Maximum Weighted Vertex Packing on Bipartite Graphs North-Holland Mathematics Studies. 66: 149-168. DOI: 10.1016/S0304-0208(08)72449-6 |
0.317 |
|
| 1982 |
Chang GJ, Nemhauser GL. R-domination on block graphs Operations Research Letters. 1: 214-218. DOI: 10.1016/0167-6377(82)90024-4 |
0.401 |
|
| 1982 |
HSU WL, Nemhauser GL. A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs Discrete Mathematics. 38: 65-71. DOI: 10.1016/0012-365X(82)90169-8 |
0.36 |
|
| 1981 |
Nemhauser GL, Wolsey LA. Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms North-Holland Mathematics Studies. 59: 279-301. DOI: 10.1016/S0304-0208(08)73471-6 |
0.515 |
|
| 1981 |
Gattass EA, Nemhauser GL. An application of vertex packing to data analysis in the evaluation of pavement deterioration Operations Research Letters. 1: 13-17. DOI: 10.1016/0167-6377(81)90018-3 |
0.443 |
|
| 1981 |
Hsu WL, Nemhauser GL. Algorithms for minimum covering by cliques and maximum clique in claw-free perfect graphs Discrete Mathematics. 37: 181-191. DOI: 10.1016/0012-365X(81)90218-1 |
0.319 |
|
| 1981 |
Hsu Wl, Ikura Y, Nemhauser GL. A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles Mathematical Programming. 20: 225-232. DOI: 10.1007/Bf01589347 |
0.351 |
|
| 1980 |
Cornuejols G, Nemhauser GL, Wolsey LA. Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem Operations Research. 28: 847-858. DOI: 10.1287/Opre.28.4.847 |
0.642 |
|
| 1980 |
Cornuejols G, Nemhauser GL, Wolsey ÂLA. A Canonical Representation of Simple Plant Location-problems and its Applications Siam Journal On Algebraic and Discrete Methods. 1: 261-272. DOI: 10.1137/0601030 |
0.353 |
|
| 1979 |
Fisher ML, Nemhauser GL, Wolsey LA. An analysis of approximations for finding a maximum weight Hamiltonian circuit Operations Research. 27: 799-809. DOI: 10.1287/Opre.27.4.799 |
0.353 |
|
| 1979 |
Cornuejols G, Fisher ML, Nemhauser GL. Note--On "Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms" Management Science. 25: 808-809. DOI: 10.1287/Mnsc.25.8.808 |
0.324 |
|
| 1979 |
Hsu WL, Nemhauser GL. Easy and hard bottleneck location problems Discrete Applied Mathematics. 1: 209-215. DOI: 10.1016/0166-218X(79)90044-1 |
0.458 |
|
| 1979 |
Nemhauser GL, Weber GM. Optimal set partitioning, matchings and lagrangian duality Naval Research Logistics Quarterly. 26: 553-563. DOI: 10.1002/Nav.3800260401 |
0.515 |
|
| 1978 |
Merchant DK, Nemhauser GL. Optimality Conditions for a Dynamic Traffic Assignment Model Transportation Science. 12: 200-207. DOI: 10.1287/Trsc.12.3.200 |
0.396 |
|
| 1978 |
Merchant DK, Nemhauser GL. A Model and an Algorithm for the Dynamic Traffic Assignment Problems Transportation Science. 12: 183-199. DOI: 10.1287/Trsc.12.3.183 |
0.498 |
|
| 1978 |
Nemhauser GL, Wolsey LA. Best Algorithms for Approximating the Maximum of a Submodular Set Function Mathematics of Operations Research. 3: 177-188. DOI: 10.1287/Moor.3.3.177 |
0.337 |
|
| 1978 |
Nemhauser GL, Wolsey LA, Fisher ML. An analysis of approximations for maximizing submodular set functions-I Mathematical Programming. 14: 265-294. DOI: 10.1007/Bf01588971 |
0.462 |
|
| 1978 |
Cornuejols G, Nemhauser GL. Tight bounds for christofides' traveling salesman heuristic Mathematical Programming. 14: 116-121. DOI: 10.1007/Bf01588956 |
0.408 |
|
| 1977 |
Cornuejols G, Fisher ML, Nemhauser GL. Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms Management Science. 23: 789-810. DOI: 10.1287/Mnsc.23.8.789 |
0.701 |
|
| 1977 |
Cornuejols G, Fisher M, Nemhauser GL. On the Uncapacitated Location Problem Annals of Discrete Mathematics. 1: 163-177. DOI: 10.1016/S0167-5060(08)70732-5 |
0.659 |
|
| 1975 |
Magazine MJ, Nemhauser GL, Trotter LE. WHEN THE GREEDY SOLUTION SOLVES A CLASS OF KNAPSACK PROBLEMS Operations Research. 23: 207-217. DOI: 10.1287/Opre.23.2.207 |
0.458 |
|
| 1975 |
Nemhauser GL, Trotter LE. Vertex packings: Structural properties and algorithms Mathematical Programming. 8: 232-248. DOI: 10.1007/Bf01580444 |
0.512 |
|
| 1974 |
Nemhauser GL, Trotter LE, Nauss RM. Set Partitioning and Chain Decomposition Management Science. 20: 1413-1423. DOI: 10.1287/Mnsc.20.11.1413 |
0.435 |
|
| 1974 |
Nemhauser GL, Trotter LE. Properties of vertex packing and independence system polyhedra Mathematical Programming. 6: 48-61. DOI: 10.1007/Bf01580222 |
0.376 |
|
| 1973 |
Leventhal T, Nemhauser G, Trotter L. A Column Generation Algorithm for Optimal Traffic Assignment Transportation Science. 7: 168-176. DOI: 10.1287/Trsc.7.2.168 |
0.439 |
|
| 1972 |
Frey SC, Nemhauser GL. Temporal Expansion of a Transportation Network---II Transportation Science. 6: 395-406. DOI: 10.1287/Trsc.6.3.306 |
0.399 |
|
| 1972 |
Nemhauser GL, Yu PL. A Problem in Bulk Service Scheduling Operations Research. 20: 813-819. DOI: 10.1287/Opre.20.4.813 |
0.477 |
|
| 1972 |
Nemhauser GL. A generalized permanent label setting algorithm for the shortest path between specified nodes Journal of Mathematical Analysis and Applications. 38: 328-334. DOI: 10.1016/0022-247X(72)90091-1 |
0.322 |
|
| 1972 |
Nemhauser GL, Yu PL. PROBLEM IN BULK SERVICE SCHEDULING Operations Research. 20: 813-819. |
0.302 |
|
| 1971 |
Nemhauser GL, Widhelm WB. A Modified Linear Program for Columnar Methods in Mathematical Programming Operations Research. 19: 1051-1060. DOI: 10.1287/Opre.19.4.1051 |
0.458 |
|
| 1970 |
Garfinkel RS, Nemhauser GL. Optimal Political Districting by Implicit Enumeration Techniques Management Science. 16: 495-508. DOI: 10.1287/Mnsc.16.8.B495 |
0.38 |
|
| 1970 |
Bowman VJ, Nemhauser GL. A finiteness proof for modified dantzig cuts in integer programming Naval Research Logistics Quarterly. 17: 309-313. DOI: 10.1002/Nav.3800170307 |
0.363 |
|
| 1969 |
Garfinkel RS, Nemhauser GL. The Set-Partitioning Problem: Set Covering with Equality Constraints Operations Research. 17: 848-856. DOI: 10.1287/Opre.17.5.848 |
0.542 |
|
| 1969 |
Nemhauser GL, Ullmann Z. Discrete Dynamic Programming and Capital Allocation Management Science. 15: 494-505. DOI: 10.1287/Mnsc.15.9.494 |
0.456 |
|
| 1969 |
Bellmore M, Eklof WD, Nemhauser GL. A decomposable transshipment algorithm for a multiperiod transportation problem Naval Research Logistics Quarterly. 16: 517-524. DOI: 10.1002/Nav.3800160406 |
0.365 |
|
| 1968 |
Nemhauser GL, Ullmann Z. Letter to the Editor—A Note on the Generalized Lagrange Multiplier Solution to an Integer Programming Problem Operations Research. 16: 450-453. DOI: 10.1287/Opre.16.2.450 |
0.52 |
|
| 1968 |
Bellmore M, Nemhauser GL. The Traveling Salesman Problem: A Survey Operations Research. 16: 538-558. DOI: 10.1007/978-3-642-51565-1_136 |
0.462 |
|
| 1968 |
Nemhauser GL, Pierce DA. Computational results for a stopping rule problem on averages Naval Research Logistics Quarterly. 15: 567-578. DOI: 10.1002/Nav.3800150409 |
0.422 |
|
| 1968 |
Howard GT, Nemhauser GL. Optimal capacity expansion Naval Research Logistics Quarterly. 15: 535-550. DOI: 10.1002/Nav.3800150407 |
0.459 |
|
| 1967 |
Goldman AJ, Nemhauser GL. A Transport Improvement Problem Transformable to a Best-Path Problem Transportation Science. 1: 295-307. DOI: 10.1287/Trsc.1.4.295 |
0.422 |
|
| 1966 |
Carlson RC, Nemhauser GL. Scheduling to Minimize Interaction Cost Operations Research. 14: 52-58. DOI: 10.1287/Opre.14.1.52 |
0.482 |
|
| 1965 |
Nemhauser GL, Nuttle HLW. A Quantitative Approach to Employment Planning Management Science. 11: 155-165. DOI: 10.1287/Mnsc.11.8.B155 |
0.423 |
|
| 1964 |
Gutjahr AL, Nemhauser GL. An Algorithm for the Line Balancing Problem Management Science. 11: 308-315. DOI: 10.1287/Mnsc.11.2.308 |
0.408 |
|
| 1964 |
Skolnik MI, Nemhauser G, Sherman JW. Dynamic Programming Applied to Unequally Spaced Arrays Ieee Transactions On Antennas and Propagation. 12: 35-43. DOI: 10.1109/Tap.1964.1138163 |
0.381 |
|
| 1964 |
Nemhauser GL. Decomposition of linear programs by dynamic programming Naval Research Logistics Quarterly. 11: 191-195. DOI: 10.1002/Nav.3800110206 |
0.403 |
|
| 1964 |
Aris R, Nemhauser GL, Wilde DJ. Optimization of multistage cyclic and braching systems by serial procedures Aiche Journal. 10: 913-919. DOI: 10.1002/Aic.690100626 |
0.337 |
|
| 1963 |
Hardgrave WW, Nemhauser GL. A Geometric Model and a Graphical Algorithm for a Sequencing Problem Operations Research. 11: 889-900. DOI: 10.1287/Opre.11.6.889 |
0.455 |
|
| 1962 |
Hardgrave WW, Nemhauser GL. On the Relation Between the Traveling-Salesman and the Longest-Path Problems Operations Research. 10: 647-657. DOI: 10.1287/Opre.10.5.647 |
0.49 |
|
| Show low-probability matches. |
