Published Papers:
 Generalized Intersection Cuts and a New Cut Generating Paradigm
Mathematical Programming A, 2011. (with: Egon Balas)
 On the Relative Strength of Split, Triangle and Quadrilateral Cuts
Mathematical Programming A, To appear. (with: Gérard Cornuéjols, Amitabh Basu, Pierre Bonami)
 An Approximate Dynamic Programming Approach to Benchmark Practice
based Heuristics for Natural Gas Storage Valuation Operations Research 58, 2010; 564582. (with: Guoming Lai, Nicola Secomandi)
 Testing Cut Generators for MixedInteger Linear Programming
Mathematical Programming Computation 1, 2009; 6995.
 Feasibility Pump for Mixed Integer Nonlinear Programs
Mathematical Programming 119, 2009; 331352. (with: Pierre Bonami, Gérard Cornuéjols, A. Lodi)
 Branching and Bound Tightening Techniques for Nonconvex MINLP
Optimization Methods and Software 24, 2009; 597634. (with: Pietro Belotti, J. Lee, L. Liberti, A. Waechter)
 Improving Bounds on the Football Pool Problem via Symmetry Reduction and HighThroughput Computing (2007)
INFORMS Journal on Computing 21, 2009; 445457. (with: J. Linderoth, G. Thain)
 On the Relative Strength of Split, Triangle and Quadrilateral Cuts
Mathematical Programming 126 126, 2011; 281314. (with: Amitabh Basu, Pierre Bonami, Gérard Cornuéjols)
 Symmetry in Integer Linear Programming
50 Years of Integer Programming, 2009.
 An Algorithmic Framework for Convex Mixed Integer Nonlinear Programs
Discrete Optimization 5, 2008; 186204. (with: Pierre Bonami, L. Biegler, et al)
 Reoptimization Approaches for the Vehicle Routing Problem with Stochastic Demands
Operations Research 57, 2009; 214230. (with: Nicola Secomandi)
 On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints
Mathematical Programming 120, 2009; 419456. (with: Gérard Cornuéjols)
 Optimization for Simulation: LAD Accelerator
Annals of Operations Research 188, 2011; 285305. (with: Miguel Lejeune)
 Integer Programming Solution Approach for InventoryProductionDistribution Problems with Direct Shipments
International Transactions in Operations Research 15, 2008; 259281. (with: Miguel Lejeune)
 On a BinaryEncoded ILP Coloring Formulation
INFORMS Journal on Computing 19, 2007; 406415. (with: J. Lee)
 Symmetric ILP: Coloring and Small Integers
Discrete Optimization 4, 2007; 4062.
 Classification of Orthogonal Arrays by Integer Programming
Journal of Statistical Planning and Inference 138, 2008; 654666. (with: Dursun Bulutoglu)
 Min Up/Min Down Polytopes
Discrete Optimization, 2004; 7785. (with: J. Lee, J. Leung)
 Exploiting Orbits in Symmetric ILP
Mathematical Programming, Ser. B, 2003; 321.
 TSP Heuristics: Domination Analysis and Complexity
Algorithmica, 2003; 111127. (with: S. Kabadi, A. Punnen)
 Decompositions, Network Flows and a Precedence Constrained Single Machine Scheduling Problem
Operations Research 51, 2003; 981992. (with: M. Queyranne, Y. Wang)
 Pruning by Isomorphism in BranchandCut
Mathematical Programming, 2002; 7190.
 Small Covering Designs by BranchandCut
Mathematical Programming, 2003; 207220.
 Pruning by Isomorphism in BranchandCut
Lecture Notes in Computer Science, 2001; 304317.
 The Packing Property
Mathematical Programming A(89), 2000; 113126. (with: Gérard Cornuéjols, B. Guenin)
 Weak KMajorization and Polyhedra
Mathematical Programming, 1998; 3753. (with: G. Dahl)
 A Category of Minimally Nonideal Matrices
Mathematical Methods of Operations Research, 1998; 221241. (with: C. Luetolf)
 Analysis of Backtrack Algorithms for Listing all Vertices and all Faces of a Convex Polyhedron
Computational Geometry, 1997; 112. (with: K. Fukuda, T. Liebling)
 Multiterminal Flows and Cuts
Operations Research Letters, 1995; 201204. (with: D. Hartvigsen)
 Node Disjoint Paths on Partial 2Trees: A Linear Algorithm and Polyhedral Results
Mathematical Methods of Operations Research, 1995; 325346. (with: A. Prodon, T. Liebling)
 Disjoint Paths in the Plane
ORSA Journal on Computing, 1995; 8488. (with: T. Liebling, D. Mueller, A. Prodon, L. Stauffer)
 Tree polytope on 2trees
Mathematical Programming, 1994; 183192. (with: A. Prodon, T. Liebling)
 Some Complexity Results About Threshold Graphs
Discrete Applied Mathematics, 1994; 299308.
 Quick Updates for Popt TSP Heuristics
Operations Research Letters, 1992; 4546.
 The Poset Scheduling Problem
Methods of Operations Research, 1990; 221230. (with: A. Prodon, T. Liebling)
 A Note on Order Preserving Matchings
Operations Research Letters, 1989; 197200. (with: A. Prodon, T. Liebling)
Working Papers:
 Relaxations of Approximate Linear Programs for the Real Option Management of Commodity Storage
April, 2014. (with: Nicola Secomandi, Selvaprabu Nadarajah)
 On the safety of Gomory cut generators
May, 2012. (with: Gérard Cornuéjols, Giacomo Nannicini)
 The Traveling Salesman Problem with Neighborhoods: MINLP solution
July, 2011. (with: Iacopo Gentilini, Kenji Shimada)
 Intersection Cuts with Infinite Split Rank
October, 2010. (with: Amitabh Basu, Gérard Cornuéjols)
 Experiments with tworow cuts from degenerate tableaux
December, 2009. (with: Amitabh Basu, Pierre Bonami, Gérard Cornuéjols)
 Linear Programming Relaxations of Quadratically Constrained Quadratic Programs
August, 2009. (with: Andrea Qualizza, Pietro Belotti)
Publications:
 "Novel Approaches to Portfolio Construction: Multiple Risk Models and MultiSolution Generation"
in S. Satchell (ed.) Optimizing Optimization, Academic Press/NorthHolland/Elsevier, (2009). (with: S. Ceria, A. Renshaw, Anureet Saxena)
 "Symmetry in Integer Programming"
in Juenger et al (ed.) 50 Years of Integer Programming, Springer, (2009).
