| Publication | Date of Publication | Type |
|---|
Piecewise polyhedral relaxations of multilinear optimization
SIAM Journal on Optimization | 2024-10-22 | Paper |
Solving sparse separable bilinear programs using lifted bilinear cover inequalities
INFORMS Journal on Computing | 2024-07-29 | Paper |
A sequential follower refinement algorithm for robust surgery scheduling
INFORMS Journal on Computing | 2024-07-29 | Paper |
Lifting convex inequalities for bipartite bilinear programs
Mathematical Programming. Series A. Series B | 2023-03-14 | Paper |
Convexification of Permutation-Invariant Sets and an Application to Sparse Principal Component Analysis
Mathematics of Operations Research | 2023-01-09 | Paper |
Solving sparse separable bilinear programs using lifted bilinear cover inequalities
| 2022-07-30 | Paper |
Lifting convex inequalities for bipartite bilinear programs
Integer Programming and Combinatorial Optimization | 2021-12-21 | Paper |
Convexification techniques for linear complementarity constraints
Journal of Global Optimization | 2021-08-11 | Paper |
Network models with unsplittable node flows with application to unit train scheduling
Operations Research | 2020-10-26 | Paper |
On cutting planes for cardinality-constrained linear programs
Mathematical Programming. Series A. Series B | 2019-10-22 | Paper |
Convexification of Permutation-Invariant Sets and an Application to Sparse PCA
| 2019-10-06 | Paper |
On the polyhedral structure of two-level lot-sizing problems with supplier selection
Naval Research Logistics | 2019-05-02 | Paper |
Deriving convex hulls through lifting and projection
Mathematical Programming. Series A. Series B | 2018-06-25 | Paper |
Multi-commodity variable upper bound flow models
Discrete Optimization | 2018-05-24 | Paper |
Simultaneous convexification of bilinear functions over polytopes with application to network interdiction
SIAM Journal on Optimization | 2017-08-18 | Paper |
A class of algorithms for mixed-integer bilevel min-max optimization
Journal of Global Optimization | 2016-10-25 | Paper |
An integrated supply chain problem: a nested Lagrangian relaxation approach
Annals of Operations Research | 2015-08-21 | Paper |
Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets
Mathematical Programming. Series A. Series B | 2014-06-27 | Paper |
A column generation-based heuristic algorithm for an inventory routing problem with perishable goods
Optimization Letters | 2013-11-01 | Paper |
A Lagrangian relaxation approach to simultaneous strategic and tactical planning in supply chain design
Annals of Operations Research | 2013-08-08 | Paper |
Explicit convex and concave envelopes through polyhedral subdivisions
Mathematical Programming. Series A. Series B | 2013-05-06 | Paper |
Linear-programming-based lifting and its application to primal cutting-plane algorithms
INFORMS Journal on Computing | 2012-07-28 | Paper |
Lifted tableaux inequalities for \(0\)-\(1\) mixed-integer programs: a computational study
INFORMS Journal on Computing | 2012-07-28 | Paper |
A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting
Discrete Optimization | 2012-06-20 | Paper |
A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting
Discrete Optimization | 2012-06-20 | Paper |
Convexification techniques for linear complementarity constraints
Integer Programming and Combinatoral Optimization | 2011-06-24 | Paper |
Strong valid inequalities for orthogonal disjunctions and bilinear covering sets
Mathematical Programming. Series A. Series B | 2010-09-16 | Paper |
The group-theoretic approach in mixed integer programming
50 Years of Integer Programming 1958-2008 | 2010-06-03 | Paper |
Relations between facets of low- and high-dimensional group problems
Mathematical Programming. Series A. Series B | 2010-04-15 | Paper |
On the extreme inequalities of infinite group problems
Mathematical Programming. Series A. Series B | 2010-02-19 | Paper |
Lifting inequalities: a framework for generating strong cuts for nonlinear programs
Mathematical Programming. Series A. Series B | 2010-02-19 | Paper |
Valid inequalities for mips and group polyhedra from approximate liftings
Mathematical Programming. Series A. Series B | 2009-05-04 | Paper |
Cook, Kannan and Schrijver's example revisited
Discrete Optimization | 2008-11-19 | Paper |
New inequalities for finite and infinite group problems from approximate lifting
Naval Research Logistics | 2008-11-19 | Paper |
Facets of Two-Dimensional Infinite Group Problems
Mathematics of Operations Research | 2008-05-27 | Paper |
A Framework to Derive Multidimensional Superadditive Lifting Functions and Its Applications
Integer Programming and Combinatorial Optimization | 2007-11-29 | Paper |
Sequential-Merge Facets for Two-Dimensional Group Problems
Integer Programming and Combinatorial Optimization | 2007-11-29 | Paper |
scientific article; zbMATH DE number 2086920 (Why is no real title available?)
| 2004-08-11 | Paper |
Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms
Mathematical Programming. Series A. Series B | 2004-03-11 | Paper |
Lifted inequalities for 0-1 mixed integer programming: superlinear lifting
Mathematical Programming. Series A. Series B | 2004-03-11 | Paper |
scientific article; zbMATH DE number 1953199 (Why is no real title available?)
| 2003-07-25 | Paper |
Globally Solving a Class of Bilevel Programs with Spatial Price Equilibrium Constraints
| N/A | Paper |
