Published Papers:
- Combining Lift-and-Project and Reduce-and-Split
INFORMS Journal on Computing, To appear.
(with: Egon Balas, Tamas Kis, Giacomo Nannicini)
- On the Relative Strength of Split, Triangle and Quadrilateral Cuts
Mathematical Programming A, To appear.
(with: Amitabh Basu, Pierre Bonami, François Margot)
- A Counterexample to a Conjecture of Gomory and Johnson
Mathematical Programming A, To appear.
(with: Amitabh Basu, Michele Conforti, Giacomo Zambelli)
- Convex Sets and Minimal Sublinear Functions
Journal of Convex Analysis, To appear.
(with: Amitabh Basu, Giacomo Zambelli)
- Maximal Lattice-free Convex Sets in Linear Subspaces
Mathematics of Operations Research, To appear.
(with: Amitabh Basu, Michele Conforti, Giacomo Zambelli)
- Minimal Inequalities for an Infinite Relaxation of Integer Programs
SIAM Journal on Discrete Mathematics 24, 2010; 158-168.
(with: Amitabh Basu, Michele Conforti, Giacomo Zambelli)
- A Geometric Perspective on Lifting
Operations Research, To appear.
(with: Michele Conforti, Giacomo Zambelli)
- On Lifting Integer Variables in Minimal Inequalities
IPCO 2010, Lausanne, LNCS 6080, 2010; 85-95.
(with: Amitabh Basu, Manoel Campelo, Michele Conforti, Giacomo Zambelli)
- Equivalence Between Intersection Cuts and the Corner Polyhedron
Operations Research Letters 38, 2010; 153-155.
- Extended Formulations in Combinatorial Optimization
4OR - Quarterly Journal of Operations Research 8, 2010; 1-48.
(with: Michele Conforti, Giacomo Zambelli)
- Branching on General Disjunctions
Mathematical Programming A, To appear.
(with: Miroslav Karamanov)
- Improved Strategies for Branching on General Disjunctions
Mathematical Programming A, To appear.
(with: L. Liberti, Giacomo Nannicini)
- Minimal Valid Inequalities for Integer Constraints
Mathematics of Operations Research 34, 2009; 538-546.
(with: Valentin Borozan)
- Stable Sets, Corner Polyhedra and the Chvatal Closure
Operations Research Letters 37, 2009; 375-378.
(with: Manoel Campelo)
- Feasibility Pump for Mixed Integer Nonlinear Programs
Mathematical Programming 119, 2009; 331-352.
(with: François Margot, Pierre Bonami, A. Lodi)
- On the Relative Strength of Split, Triangle and Quadrilateral Cuts
Mathematical Programming 126 126, 2011; 281-314.
(with: Amitabh Basu, Pierre Bonami, François Margot)
- An Algorithmic Framework for Convex Mixed Integer Nonlinear Programs
Discrete Optimization, 2008.
(with: Pierre Bonami, et al)
- Valid Inequalities for Mixed Integer Linear Programs
Mathematical Programming B, 2008.
- On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints
Mathematical Programming 120, 2009; 419-456.
(with: François Margot)
- Revival of the Gomory Cuts in the 1990's
State-of-the-Art and Recent Advances in Integer Programming, 2005.
- Recognizing Berge Graphs
Combinatorica 25, 2005; 143-186.
(with: Maria Chudnovsky, Xinming Liu, Paul Seymour, Kristina Vuskovic)
- Early Estimates of the Size of Branch-and-Bound Trees
INFORMS Journal on Computing, 2004.
(with: Miroslav Karamanov, Yanjun Li)
- Bicolorings and Equitable Bicolorings of Matrices
MPS/SIAM Series on Optimization, The Sharpest Cut: The Impact of Manfred Padberg and His Work, 2004; 33-37.
(with: Michele Conforti, Giacomo Zambelli)
- Square-Free Perfect Graphs
Journal of Combinatorial Theory B(90), 2004; 257-307.
(with: Michele Conforti, Kristina Vuskovic)
- Decomposition of Odd-Hole-Free Graphs, by Double Star Cutsets and 2-Joins
Discrete mathematics 141, 2004; 41-91.
(with: Michele Conforti, Kristina Vuskovic)
- Reduce-and-Split Cuts: Improving the Performance of Mixed Integer Gomory Cuts
Management Science, 2003.
(with: K. A. Andersen, Yanjun Li)
- Balanced Matrices
Discrete Mathematics, 2003.
(with: Michele Conforti, Kristina Vuskovic)
- The Strong Perfect Graph Theorem
Optima 70, 2003; 2-6.
- Graphs without Odd Holes, Parachutes or Proper Wheels: A Generalization of Meyniel Graphs and of Line Graphs of Bipartite Graphs
Journal of Combinatorial Theory B(87), 2003; 331-347.
(with: Michele Conforti)
- A Class of Berge Graphs Containing P6
Journal of Combinatorial Theory B(87), 2003; 300-330.
(with: Xinming Liu)
- K-Cuts: A Variation of Gomory Mixed Integer Cuts from the LP Tableau
INFORMS Journal on Computing 15, 2003; 385-396.
(with: Yanjun Li, Dieter Vandenbussche)
- Decomposing Berge Graphs Containing No Proper Wheel, Long Prism or their Complements
Combinatorica, 2002.
(with: Michele Conforti, Giacomo Zambelli)
- A Note on Dijoins
Discrete Mathematics 243, 2002; 213-216.
(with: B. Guenin)
- Ideal Binary Clutters, Connectivity and a Conjecture of Seymour
SIAM Journal on Discrete Mathematics 15, 2002; 329-352.
(with: B. Guenin)
- Ideal Clutters
Discrete Applied Mathematics 123, 2002; 303-338.
(with: B. Guenin)
- Even-Hole-Free Graphs Part II: Recognition Algorithm
Journal of Graph Theory 40, 2002; 238-266.
(with: Michele Conforti, Ajai Kapoor, Kristina Vuskovic)
- Even-Hole-Free Graphs Part I: Decomposition Theorem
Journal of Graph Theory 39, 2002; 6-49.
(with: Michele Conforti, Ajai Kapoor, Kristina Vuskovic)
- Perfect Graphs, Partitionable Graphs and Cutsets
Combinatorica 22, 2002; 19-33.
(with: Michele Conforti, Grigor Gasparyan, Kristina Vuskovic)
- On the Rank of Mixed 0, 1 Polyhedra
Mathematical Programming A(91), 2002; 391-397.
(with: Yanjun Li)
- A Connection Between Cutting Plane Theory and the Geometry of Numbers
Mathematical Programming A(93), 2002; 123-127.
(with: Yanjun Li)
- Balanced 0+-1 Matrices Part I: Decomposition
Journal of Combinatorial Theory B(81), 2001; 243-274.
(with: Michele Conforti, Ajai Kapoor, Kristina Vuskovic)
- Balanced 0+-1 Matrices Part II: Recognition Algorithm
Journal of Combinatorial Theory B(81), 2001; 275-306.
(with: Michele Conforti, Ajai Kapoor, Kristina Vuskovic)
- On Padberg's Conjecture about Almost Totally Unimodular Matrices
Operations Research Letters 27, 2000; 97-99.
(with: Luis F. Zuluaga)
- The Packing Property
Mathematical Programming A(89), 2000; 113-126.
(with: François Margot, B. Guenin)
- Decomposition of Balanced Matrices
Journal of Combinatorial Theory B(77), 1999; 292-406.
(with: Michele Conforti, M. Rao)
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework (with S. Ceria and G. Cornuéjols)
Management Science 42, 1996; 1229-1246.
(with: Egon Balas, Sebastian Ceria)
- A Lift-and-Project Cutting Plane Algorithm for Mixed 0-1 Programs
Mathematical Programming 58, 1993; 295-324.
(with: Egon Balas, Sebastian Ceria)
Working Papers:
- On the safety of Gomory cut generators
May, 2012.
(with: François Margot, Giacomo Nannicini)
- Intersection Cuts with Infinite Split Rank
October, 2010.
(with: Amitabh Basu, François Margot)
- Reduce-and-Split Revisited: Efficient Generation of Split cuts for Mixed-integer Linear Programs
April, 2010.
- Experiments with two-row cuts from degenerate tableaux
December, 2009.
(with: Amitabh Basu, Pierre Bonami, François Margot)
- Mixed Integer NonLinear Programs Featuring "On/Off" Constraints: Convex Analysis and Applications
October, 2009.
(with: Hassan Hijazi, Pierre Bonami, Adam Ouorou)
Publications:
- "Polyhedral Approaches to Mixed Integer Linear Programming"
in Michael Juenger (ed.) 50 Years of Integer Programming, 343-386, Springer Verlag, (2009).
(with: Michele Conforti, Giacomo Zambelli)
- Optimization Methods in Finance, Cambridge University Press, (2007).
(with: R. Tutuncu)
- Combinatorial Optimization: Packing and Covering, SIAM, (2001).
|
