Published Papers:
- An Approximate Dynamic Programming Approach to Benchmark Practice-based Heuristics for Natural Gas Storage Valuation
Operations Research, Forthcoming.
(With: Guoming Lai, Nicola Secomandi)
- Testing Cut Generators for Mixed-Integer Linear Programming
Mathematical Programming Computation 1, 2009; 69-95.
- Feasibility Pump for Mixed Integer Nonlinear Programs
Mathematical Programming 119, 2009; 331-352.
(With: Pierre Bonami, Gérard Cornuéjols, A. Lodi)
- On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints
Mathematical Programming 120, 2009; 429-456.
(With: Gérard Cornuéjols)
- Reoptimization Approaches for the Vehicle Routing Problem with Stochastic Demands
Operations Research 57, 2009; 214-230.
(With: Nicola Secomandi)
- On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints
Mathematical Programming 120, 2009; 419-456.
(With: Gérard Cornuéjols)
- Integer Programming Solution Approach for Inventory-Production-Distribution Problems with Direct Shipments
International Transactions in Operations Research 15, 2008; 259-281.
(With: Miguel Lejeune)
- On a Binary-Encoded ILP Coloring Formulation
INFORMS Journal on Computing 19, 2007; 406-415.
(With: J. Lee)
- Symmetric ILP: Coloring and Small Integers
Discrete Optimization 4, 2007; 40-62.
- Classification of Orthogonal Arrays by Integer Programming
Journal of Statistical Planning and Inference 138, 2008; 654-666.
(With: Dursun Bulutoglu)
- Min Up/Min Down Polytopes
Discrete Optimization, 2004; 77-85.
(With: J. Lee, J. Leung)
- Small Covering Designs by Branch-and-Cut
Mathematical Programming, 2003; 207-220.
- Decompositions, Network Flows and a Precedence Constrained Single Machine Scheduling Problem
Operations Research 51, 2003; 981-992.
(With: M. Queyranne, Y. Wang)
- Exploiting Orbits in Symmetric ILP
Mathematical Programming, Ser. B, 2003; 3-21.
- TSP Heuristics: Domination Analysis and Complexity
Algorithmica, 2003; 111-127.
(With: S. Kabadi, A. Punnen)
- Pruning by Isomorphism in Branch-and-Cut
Mathematical Programming, 2002; 71-90.
- OCTANE: A New Heuristic for Pure 0-1 Programs
Operations Research, 2001; 207-225.
(With: Egon Balas, S. Ceria, Milind Dawande, G. Pataki)
- Pruning by Isomorphism in Branch-and-Cut
Lecture Notes in Computer Science, 2001; 304-317.
- The Packing Property
Mathematical Programming A, 2000; 113-126.
(With: Gérard Cornuéjols, B. Guenin)
- The Packing Property
Lecture Notes in Computer Science, 1998; 1-8.
(With: Gérard Cornuéjols, B. Guenin)
- Weak K-Majorization and Polyhedra
Mathematical Programming, 1998; 37-53.
(With: G. Dahl)
- A Category of Minimally Nonideal Matrices
Mathematical Methods of Operations Research, 1998; 221-241.
(With: C. Luetolf)
- Analysis of Backtrack Algorithms for Listing all Vertices and all Faces of a Convex Polyhedron
Computational Geometry, 1997; 1-12.
(With: K. Fukuda, T. Liebling)
- Multiterminal Flows and Cuts
Operations Research Letters, 1995; 201-204.
(With: D. Hartvigsen)
- Node Disjoint Paths on Partial 2-Trees: A Linear Algorithm and Polyhedral Results
Mathematical Methods of Operations Research, 1995; 325-346.
(With: A. Prodon, T. Liebling)
- Disjoint Paths in the Plane
ORSA Journal on Computing, 1995; 84-88.
(With: T. Liebling, D. Mueller, A. Prodon, L. Stauffer)
- Tree polytope on 2-trees
Mathematical Programming, 1994; 183-192.
(With: A. Prodon, T. Liebling)
- Some Complexity Results About Threshold Graphs
Discrete Applied Mathematics, 1994; 299-308.
- Quick Updates for P-opt TSP Heuristics
Operations Research Letters, 1992; 45-46.
- The Poset Scheduling Problem
Methods of Operations Research, 1990; 221-230.
(With: A. Prodon, T. Liebling)
- A Note on Order Preserving Matchings
Operations Research Letters, 1989; 197-200.
(With: A. Prodon, T. Liebling)
|
