|
See also Recommended Reading for technical papers on optimization not written by members of the ILOG R&D Team.
2006
“Vehicle Routing Problem with elementary shortest path based column generation”, Alain Chabrier. Computers & Operations Research, 33(10) ,2972-2990. 2006.
2005
“A Fast Arc Consistency Algorithm for n- ary Constraints”, O. Lhomme, J-.C. Regin :. AAAI 2005, pages 405-410, 2005.
“Branch-and-price heuristics: A case study on the vehicle routing problem with time windows,” Emilie Danna and Claude Le Pape. In G. Desaulniers, J. Desrosiers, M.M. Solomon (eds.), Column Generation, 99-129. Springer, 2005.
“Continuous Filling and Emptying of Storage Systems in constraint-based Scheduling “, F. Sourd, J. Rogerie .. European Journal of Operational Research, 165:510-524, 2005.
“Exploring relaxation induced neighborhoods to improve MIP solutions,” Emilie Danna, Edward Rothberg, and Claude Le Pape. Mathematical Programming, 102 (1), 71-91, 2005.
“Symmetry Breaking Revisited”, J.-F. Puget. Constraints 10:23-46, 2005.
2004
“Mixed-Integer Programming: A Progress Report,” Robert. E. Bixby, Mary Fenelon, Zonghao Gu, Edward Rothberg, and Roland Wunderling. In Martin Grötschel (ed.), The Sharpest Cut: The Impact of Manfred Padberg and His Work, MPS-SIAM Series on Optimization 4, 2004.
“Solving a network design problem,” Alain Chabrier, Emilie Danna, Claude Le Pape, and Laurent Perron. Annals of Operations Research, 130 (1-4), 217-239, 2004.
2003
“An Efficient Filtering Algorithm for Disjunction of Constraints”, O. Lhomme, CP 2003, pages 904-908, 2003.
“A Hybrid Approach to Scheduling with Earliness and Tardiness Costs“, C. Beck, P. Refalo. Annals of Operations Research 118:49-71, 2003.
“Local Search and Constraint Programming”, F. Focacci, F. Laburthe, A. Lodi. International Series in Operations Research and Management Science, 57:369-404, 2003.
“Algorithms for Propagating Resource Constraints in AI Planning and Scheduling: Existing Approaches and New Results”, P. Laborie. Artificial Intelligence Journal. Vol 143/2 pp151-188. 2003.
“Two generic schemes for efficient and robust cooperative algorithms,” Emilie Danna and Claude Le Pape. In Michela Milano (ed.), Constraint and Integer Programming, 33-58. Kluwer , 2003.
2002
“Solving real-world linear programs: a decade and more of progress,” Robert E. Bixby. Operations Research 50(1), 3-15, 2002.
“Local search with constraint propagation and conflict-based heuristics”, N. Jussien, O. Lhomme. Artificial Intelligence 139:21-45, 2002.
“Cost-Based Arc Consistency for Global Cardinality Constraints. Constraints”, J.-C. Régin: 7:387-405, 2002.
“Improved Local Search for CP Toolkits”, P. Shaw, B. De Backer, V. Furnon .. Annals of Operations Research, 115, pages 31-50, 2002.
2001
“Program Does Not Equal Program: Constraint Programming and Its Relationship to Mathematical Programming”, I. J. Lustig, J.-F. Puget. Interfaces 31:29-53, 2001.
"Constraint programming and maths programming," Jean- Francois Puget and Irvin J. Lustig. The Knowledge Engineering Review 16(1), 5-23, 2001.
2000
“MIP: Theory and practice -- closing the gap,” Robert. E. Bixby, Mary Fenelon, Zonghao Gu, Edward Rothberg, and Roland Wunderling. In M. J. D. Powell and S. Scholtes, (eds.), System Modelling and Optimization: Methods, Theory, and Applications, pages 19--49. Kluwer Academic Publishers, 2000.
“Search and Strategies in OPL”, P. van Hentenryck, L. Perron, J.-F Puget. . ACM Transactions on Computational Logic 1:285-320, 2000.
“Solving Vehicle Routing Problems with Constraint Programming and Meta-heuristics” , B. De Backer, V. Furnon, P. Kilby, P. Prosser, P. Shaw. Journal of Heuristics 6:4, pages 501-524, 2000.
“Parallelizing the Dual Simplex Method,” Robert E. Bixby and Alexander Martin. INFORMS Journal on Computing, 12(1), 45-56, 2000.
“Sequence Independent Lifting in Mixed Integer Programming” , Zonghao Gu, George L. Nemhauser, and Martin W.P. Savelsbergh. Journal of Combinatorial Optimization 4, 109-129, 2000.
Early Papers
“Lifted Flow Covers for Mixed 0-1 Integer Programs,” Zonghao Gu, George L. Nemhauser, and Martin W.P. Savelsbergh. Mathematical Programming 85, 439-468, 1999.
“Computational experience with parallel mixed integer programming in a distributed environment,” Robert E. Bixby, William Cook, Alan Cox, Eva K. Lee, Annals of OR, 90, 19-43, 1999.
“ Satisfiability Tests and Time-Bound Adjustments for Cumulative Scheduling Problems”, P. Baptiste, C. Le Pape, W. Nuijten .. Annals of Operations Research 92:305-333, 1999. 1999.
“Lifted Cover Inequalities for 0-1 Integer Programs: Computation,” Zonghao Gu, George L. Nemhauser, and Martin W.P. Savelsbergh. INFORMS Journal of Computing, 10, 427-437, 1998.
“Sparse matrix ordering methods for interior point linear programming,” Edward Rothberg and Bruce Hendrickson, INFORMS Journal on Computing, 10(1), 107-113, 1998.
"Gigaflops in Linear Programming, " Irvin J. Lustig and Edward Rothberg. Operations Research Letters 18(4), 157-165, 1996.
“Progress in Linear Programming,” Robert E. Bixby. INFORMS Journal on Computing, 6(1), 15-22, 1994.
“Recovering an optimal LP basis from an interior point solution”, Matthew J. Saltzman and Robert E. Bixby. Operations Research Letters, 15(4), 169-178, 1994.
"Interior Point Methods for Linear Programming: Computational State of the Art," Irvin J. Lustig, Roy E. Marsten, and David F. Shanno. INFORMS Journal on Computing 6(1), 1-14, 1994.
"The Last Word on Interior Point Methods for Linear Programming-For Now," Rejoinder, Irvin J. Lustig, Roy E. Marsten, and David F. Shanno. INFORMS Journal on Computing 6(1), 35, 1994.
“An Application of Constraint Programming to a Specific Production Scheduling Problem”, C. Le Pape. In Belgian Journal of Operations Research, Statistics and Computer Science, 1995.
"Higher Order Predictor-Corrector Interior Point Methods with Application to Quadratic Objectives," Tamra J. Carpenter, Irvin J. Lustig , John M. Mulvey and David F. Shanno. SIAM Journal on Optimization 3, 696-725, 1993.
"Separable quadratic programming via a primal-dual interior point method and its use in a sequential procedure", Tamra J. Carpenter, Irvin J. Lustig , John M. Mulvey and David F. Shanno. ORSA Journal on Computing 5(2), 182-191, 1993.
“Implementing the Simplex Method: The Initial Basis.,” Robert E. Bixby. INFORMS Journal on Computing, 4(3), 267-284, 1992.
"Computational Experience with a Globally Convergent Primal-Dual Predictor-Corrector Algorithm for Linear Programming," Irvin J. Lustig, Roy E. Marsten, and David F. Shanno. Mathematical Programming 66, 123-135, 1992.
Lustig, I.J. and Li, G. (1992). "An implementation of a parallel primal-dual interior point method for multicommodity flow problems," Computational Optimization and its Applications 1(2), 141-161.
"Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods," Robert E. Bixby, John W. Gregory, Irvin J. Lustig, Roy E. Marsten, and David F. Shanno. Operations Research 40(5), 885-897, 1992.
"On implementing Mehrotra's predictor-corrector interior point method for linear programming," Irvin J. Lustig, Roy E. Marsten, and David F. Shanno. SIAM Journal on Optimization 2(3), 435-449, 1992.
"The interior-point method for linear programming," G. Astfalk, Irvin J. Lustig, Roy E. Marsten, and David F. Shanno. IEEE Software 9(4), 61-68, 1992.
"Computational experience with a primal-dual interior point method for linear programming," Irvin J. Lustig, Roy E. Marsten, and David F. Shanno. Linear Algebra and its Applications 152, 191-222, 1991.
"Formulating two-stage stochastic programs for interior point methods," Irvin J. Lustig, John M. Mulvey, and Tamra J. Carpenter. Operations Research, 39(5), 757-770, 1991.
"Feasibility issues in a primal-dual interior point method for linear programming," Irvin J. Lustig, Mathematical Programming, 49(2), 145-162, 1990.
"Interior point methods for linear programming: Just call Newton, Lagrange, and Fiacco and McCormick!," Roy E. Marsten, Radhika Subramanian, Matthew Saltzman, Irvin J. Lustig, David F. Shanno, Interfaces, 20(4), 105-116, 1990.
|
