| Publication | Date of Publication | Type |
|---|
Parallel token swapping for qubit routing
Discrete Applied Mathematics | 2025-09-17 | Paper |
Convexifying multilinear sets with cardinality constraints: structural properties, nested case and extensions
Discrete Optimization | 2025-07-16 | Paper |
Recovering Dantzig-Wolfe bounds by cutting planes
Operations Research | 2025-06-05 | Paper |
Robust-to-dynamics optimization
Mathematics of Operations Research | 2025-06-02 | Paper |
Binary matrix factorization and completion via integer programming
Mathematics of Operations Research | 2024-06-27 | Paper |
Special issue: International symposium on mathematical programming 2022
Mathematical Programming. Series A. Series B | 2023-06-23 | Paper |
| Recovering Dantzig-Wolfe Bounds by Cutting Planes | 2023-01-30 | Paper |
Multilinear sets with two monomials and cardinality constraints
Discrete Applied Mathematics | 2022-11-11 | Paper |
On a generalization of the Chvátal-Gomory closure
Integer Programming and Combinatorial Optimization | 2022-10-14 | Paper |
On a generalization of the Chvátal-Gomory closure
Mathematical Programming. Series A. Series B | 2022-03-22 | Paper |
Generalized Chvátal-Gomory closures for integer programs with bounds on variables
Mathematical Programming. Series A. Series B | 2021-10-20 | Paper |
Optimal decision trees for categorical data via integer programming
Journal of Global Optimization | 2021-08-17 | Paper |
| Cardinality constrained multilinear sets | 2021-02-04 | Paper |
| Convexifying Multilinear Sets with Cardinality Constraints: Structural Properties, Nested Case and Extensions | 2020-07-30 | Paper |
Lattice closures of polyhedra
Mathematical Programming. Series A. Series B | 2020-06-10 | Paper |
A note on capacity models for network design
Operations Research Letters | 2019-06-11 | Paper |
A note on capacity models for network design
Operations Research Letters | 2019-06-11 | Paper |
Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
Mathematical Programming Computation | 2018-11-09 | Paper |
Binary extended formulations of polyhedral mixed-integer sets
Mathematical Programming. Series A. Series B | 2018-07-13 | Paper |
On the relative strength of different generalizations of split cuts
Discrete Optimization | 2018-05-24 | Paper |
A new lift-and-project operator
European Journal of Operational Research | 2018-05-24 | Paper |
| Binary Extended Formulations | 2018-01-03 | Paper |
On Capacity Models for Network Design
(available as arXiv preprint) | 2017-11-28 | Paper |
On the polyhedrality of closures of multibranch split sets and other polyhedra with bounded max-facet-width
SIAM Journal on Optimization | 2017-07-27 | Paper |
| Multi-Commodity Multi-Facility Network Design | 2017-07-12 | Paper |
Strengthened benders cuts for stochastic integer programs with continuous recourse
INFORMS Journal on Computing | 2017-06-02 | Paper |
Cutting planes from extended LP formulations
Mathematical Programming. Series A. Series B | 2017-02-03 | Paper |
On the polyhedrality of cross and quadrilateral closures
Mathematical Programming. Series A. Series B | 2016-11-25 | Paper |
A time bucket formulation for the traveling salesman problem with time windows
INFORMS Journal on Computing | 2016-06-29 | Paper |
The continuous knapsack set
Mathematical Programming. Series A. Series B | 2016-02-23 | Paper |
Discretization vertex orders in distance geometry
Discrete Applied Mathematics | 2015-09-30 | Paper |
Computational experiments with cross and crooked cross cuts
INFORMS Journal on Computing | 2015-01-26 | Paper |
Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming
Mathematical Programming. Series A. Series B | 2014-06-27 | Paper |
On t-branch split cuts for mixed-integer programs
Mathematical Programming. Series A. Series B | 2013-11-11 | Paper |
On some generalizations of the split closure
Integer Programming and Combinatorial Optimization | 2013-03-19 | Paper |
Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra
Mathematical Programming. Series A. Series B | 2012-10-15 | Paper |
Two-step MIR inequalities for mixed integer programs
INFORMS Journal on Computing | 2012-07-28 | Paper |
Perspective reformulation and applications
Mixed Integer Nonlinear Programming | 2012-07-10 | Paper |
A polytope for a product of real linear functions in 0/1 variables
Mixed Integer Nonlinear Programming | 2012-07-10 | Paper |
Strengthening lattice-free cuts using non-negativity
Discrete Optimization | 2012-06-20 | Paper |
The master equality polyhedron with multiple rows
Mathematical Programming. Series A. Series B | 2012-04-27 | Paper |
On mixed-integer sets with two integer variables
Operations Research Letters | 2012-04-05 | Paper |
A branch-and-price algorithm and new test problems for spectrum auctions
Management Science | 2012-02-21 | Paper |
A note on the MIR closure and basic relaxations of polyhedra
Operations Research Letters | 2011-08-19 | Paper |
On a generalization of the master cyclic group polyhedron
Mathematical Programming. Series A. Series B | 2010-10-13 | Paper |
Perspective reformulations of mixed integer nonlinear programs with indicator variables
Mathematical Programming. Series A. Series B | 2010-09-16 | Paper |
On mixing inequalities: rank, closure, and cutting-plane proofs
SIAM Journal on Optimization | 2010-06-01 | Paper |
Mingling: mixed-integer rounding with bounds
Mathematical Programming. Series A. Series B | 2010-04-15 | Paper |
Erratum to: MIR closures of polyhedral sets
Mathematical Programming. Series A. Series B | 2010-04-15 | Paper |
MIR closures of polyhedral sets
Mathematical Programming. Series A. Series B | 2010-02-19 | Paper |
A pricing problem under Monge property
Discrete Optimization | 2008-10-29 | Paper |
On the strength of Gomory mixed-integer cuts as group cuts
Mathematical Programming. Series A. Series B | 2008-10-16 | Paper |
Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables
Integer Programming and Combinatorial Optimization | 2008-06-10 | Paper |
A New Min‐Cut Max‐Flow Ratio for Multicommodity Flows
SIAM Journal on Discrete Mathematics | 2008-03-28 | Paper |
On the MIR Closure of Polyhedra
Integer Programming and Combinatorial Optimization | 2007-11-29 | Paper |
On a Generalization of the Master Cyclic Group Polyhedron
Integer Programming and Combinatorial Optimization | 2007-11-29 | Paper |
Network design arc set with variable upper bounds
Networks | 2007-07-20 | Paper |
Valid inequalities based on the interpolation procedure
Mathematical Programming. Series A. Series B | 2006-05-02 | Paper |
Valid inequalities based on simple mixed-integer sets
Mathematical Programming. Series A. Series B | 2006-01-13 | Paper |
Integer Programming and Combinatorial Optimization
Lecture Notes in Computer Science | 2005-12-23 | Paper |
Reformulating linear programs with transportation constraints-With applications to workforce scheduling
Naval Research Logistics | 2005-02-22 | Paper |
| scientific article; zbMATH DE number 2086913 (Why is no real title available?) | 2004-08-11 | Paper |
An integer programming model for the weekly tour scheduling problem
Naval Research Logistics | 2002-03-14 | Paper |
Mixing mixed-integer inequalities
Mathematical Programming. Series A. Series B | 2001-01-01 | Paper |
Minimum cost capacity installation for multicommodity network flows
Mathematical Programming. Series A. Series B | 1999-10-18 | Paper |
A branch-and-cut algorithm for capacitated network design problems
Mathematical Programming. Series A. Series B | 1999-01-01 | Paper |
Capacitated Network Design—Polyhedral Structure and Computation
INFORMS Journal on Computing | 1997-01-15 | Paper |
Computational experience with a difficult mixed-integer multicommodity flow problem
Mathematical Programming. Series A. Series B | 1996-04-18 | Paper |
A degree sequence problem related to network design
Networks | 1994-08-29 | Paper |
