| Publication | Date of Publication | Type |
|---|
Optimizing over path-length matrices of unrooted binary trees
Mathematical Programming. Series A. Series B | 2026-01-16 | Paper |
A study of lattice reformulations for integer programming
Operations Research Letters | 2023-09-12 | Paper |
Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing
European Journal of Operational Research | 2023-07-11 | Paper |
| Decomposition of integer programs and of generating sets | 2021-12-20 | Paper |
Improved models for a single vehicle continuous-time inventory routing problem with pickups and deliveries
European Journal of Operational Research | 2021-11-09 | Paper |
Lattice reformulation cuts
SIAM Journal on Optimization | 2021-11-05 | Paper |
Convex hull results for generalizations of the constant capacity single node flow set
Mathematical Programming. Series A. Series B | 2021-04-23 | Paper |
| Integer Programming | 2020-10-28 | Paper |
On the balanced minimum evolution polytope
Discrete Optimization | 2020-07-30 | Paper |
The item dependent stockingcost constraint
Constraints | 2019-11-27 | Paper |
``Facet'' separation with one linear program
Mathematical Programming. Series A. Series B | 2019-10-22 | Paper |
Erratum: ``Submodularity and valid inequalities in capacitated fixed charge networks''
Operations Research Letters | 2019-07-22 | Paper |
Convex hull results for the warehouse problem
Discrete Optimization | 2019-01-14 | Paper |
Optimum turn-restricted paths, nested compatibility, and optimum convex polygons
Journal of Combinatorial Optimization | 2018-07-26 | Paper |
Single-item reformulations for a vendor managed inventory routing problem: computational experience with benchmark instances
Networks | 2018-05-23 | Paper |
| The weighted arborescence constraint | 2017-08-04 | Paper |
Tight MIP formulations for bounded up/down times and interval-dependent start-ups
Mathematical Programming. Series A. Series B | 2017-07-21 | Paper |
LS-LIB: a library of tools for solving production planning problems
Research Trends in Combinatorial Optimization | 2017-04-07 | Paper |
On the practical strength of two-row tableau cuts
INFORMS Journal on Computing | 2017-02-17 | Paper |
Erratum: a tight formulation for uncapacitated lot-sizing with stock upper bounds
Mathematical Programming. Series A. Series B | 2017-02-03 | Paper |
A maritime inventory routing problem: discrete time formulations and valid inequalities
Networks | 2016-06-10 | Paper |
Continuous knapsack sets with divisible capacities
Mathematical Programming. Series A. Series B | 2016-04-04 | Paper |
The continuous knapsack set
Mathematical Programming. Series A. Series B | 2016-02-23 | Paper |
Sufficiency of cut-generating functions
Mathematical Programming. Series A. Series B | 2015-08-31 | Paper |
Covering linear programming with violations
INFORMS Journal on Computing | 2015-01-27 | Paper |
Strong and compact relaxations in the original space using a compact extended formulation
EURO Journal on Computational Optimization | 2014-09-30 | Paper |
Relaxations for two-level multi-item lot-sizing problems
Mathematical Programming. Series A. Series B | 2014-08-29 | Paper |
On discrete lot-sizing and scheduling on identical parallel machines
Optimization Letters | 2012-11-30 | Paper |
MIP formulations and heuristics for two-level production-transportation problems
Computers & Operations Research | 2012-11-15 | Paper |
Composite lifting of group inequalities and an application to two-row mixing inequalities
Discrete Optimization | 2012-06-20 | Paper |
Integer programming and constraint programming in solving a multimachine assignment scheduling problem with deadlines and release dates
INFORMS Journal on Computing | 2012-06-18 | Paper |
Mixing sets linked by bidirected paths
SIAM Journal on Optimization | 2012-03-16 | Paper |
Modelling practical lot-sizing problems as mixed-integer programs
Management Science | 2012-02-19 | Paper |
Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation
Management Science | 2012-02-19 | Paper |
bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
Management Science | 2012-02-12 | Paper |
| scientific article; zbMATH DE number 6000617 (Why is no real title available?) | 2012-01-26 | Paper |
Erratum: Lot-sizing with stock upper bounds and fixed charges
SIAM Journal on Discrete Mathematics | 2011-10-27 | Paper |
Lot-sizing with stock upper bounds and fixed charges
SIAM Journal on Discrete Mathematics | 2011-06-17 | Paper |
Projecting an extended formulation for mixed-integer covers on bipartite graphs
Mathematics of Operations Research | 2011-04-27 | Paper |
Network Formulations of Mixed-Integer Programs
Mathematics of Operations Research | 2011-04-27 | Paper |
Constrained infinite group relaxations of MIPs
SIAM Journal on Optimization | 2011-03-21 | Paper |
Two row mixed-integer cuts via lifting
Mathematical Programming. Series A. Series B | 2010-09-16 | Paper |
Traces of the XII Aussois Workshop on combinatorial optimization
Mathematical Programming. Series A. Series B | 2010-09-16 | Paper |
Uncapacitated two-level lot-sizing
Operations Research Letters | 2010-09-07 | Paper |
Experiments with two row tableau cuts
Integer Programming and Combinatorial Optimization | 2010-06-22 | Paper |
Reformulation and decomposition of integer programs
50 Years of Integer Programming 1958-2008 | 2010-06-03 | Paper |
Single item lot-sizing with non-decreasing capacities
Mathematical Programming. Series A. Series B | 2010-02-19 | Paper |
Lattice based extended formulations for integer linear equality systems
Mathematical Programming. Series A. Series B | 2010-02-19 | Paper |
Lattice based extended formulations for integer linear equality systems
Mathematical Programming. Series A. Series B | 2010-02-19 | Paper |
Optimizing production and transportation in a commit-to-delivery business mode
European Journal of Operational Research | 2009-12-21 | Paper |
Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times
Computers & Operations Research | 2009-10-16 | Paper |
Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems
Operations Research | 2009-07-09 | Paper |
Aggregation and Mixed Integer Rounding to Solve MIPs
Operations Research | 2009-07-03 | Paper |
Two ``well-known'' properties of subgradient optimization
Mathematical Programming. Series A. Series B | 2009-05-05 | Paper |
Multi-item lot-sizing with joint set-up costs
Mathematical Programming. Series A. Series B | 2009-04-24 | Paper |
Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles
Integer Programming and Combinatorial Optimization | 2008-06-10 | Paper |
The Mixing Set with Divisible Capacities
Integer Programming and Combinatorial Optimization | 2008-06-10 | Paper |
Compact formulations as a union of polyhedra
Mathematical Programming. Series A. Series B | 2008-06-04 | Paper |
Lot-sizing on a tree
Operations Research Letters | 2008-05-29 | Paper |
The Mixing Set with Flows
SIAM Journal on Discrete Mathematics | 2008-05-22 | Paper |
Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
Annals of Operations Research | 2008-03-31 | Paper |
Inequalities from Two Rows of a Simplex Tableau
Integer Programming and Combinatorial Optimization | 2007-11-29 | Paper |
The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows
Integer Programming and Combinatorial Optimization | 2007-11-29 | Paper |
Production Planning by Mixed Integer Programming
Springer Series in Operations Research and Financial Engineering | 2006-06-14 | Paper |
Lot-sizing with production and delivery time windows
Mathematical Programming. Series A. Series B | 2006-06-14 | Paper |
Combinatorial optimization: Theory and computation. The Aussois Workshop 2004. Introduction
Mathematical Programming. Series A. Series B | 2006-01-13 | Paper |
Approximate extended formulations
Mathematical Programming. Series A. Series B | 2006-01-13 | Paper |
Combining Problem Structure with Basis Reduction to Solve a Class of Hard Integer Programs
Mathematics of Operations Research | 2005-11-11 | Paper |
| scientific article; zbMATH DE number 2196274 (Why is no real title available?) | 2005-08-22 | Paper |
Extended formulations for Gomory corner polyhedra
Discrete Optimization | 2005-08-22 | Paper |
Uncapacitated lot-sizing with buying, sales and backlogging
Optimization Methods & Software | 2005-03-14 | Paper |
On unions and dominants of polytopes
Mathematical Programming. Series A. Series B | 2004-07-01 | Paper |
On the cut polyhedron.
Discrete Mathematics | 2004-03-14 | Paper |
Tight formulations for some simple mixed integer programs and convex objective integer programs
Mathematical Programming. Series A. Series B | 2004-03-11 | Paper |
Dynamic knapsack sets and capacitated lot-sizing
Mathematical Programming. Series A. Series B | 2003-10-29 | Paper |
The Aussois 2000 workshop in combinatorial optimization. Introduction
Mathematical Programming. Series A. Series B | 2003-10-29 | Paper |
Strong formulations for mixed integer programs: valid inequalities and extended formulations
Mathematical Programming. Series A. Series B | 2003-09-01 | Paper |
Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
4OR | 2003-01-01 | Paper |
Cutting planes in integer and mixed integer programming
Discrete Applied Mathematics | 2002-09-17 | Paper |
Non-standard approaches to integer programming
Discrete Applied Mathematics | 2002-09-17 | Paper |
Optimal placement of add/drop multiplexers: Heuristic and exact algorithms
Operations Research | 2002-07-01 | Paper |
Scheduling projects with labor constraints
Discrete Applied Mathematics | 2002-02-27 | Paper |
On the Wagner-Whitin lot-sizing polyhedron.
Mathematics of Operations Research | 2001-11-26 | Paper |
The uncapacitated lot-sizing problem with sales and safety stocks
Mathematical Programming. Series A. Series B | 2001-10-03 | Paper |
\(bc\)-\(opt\): A branch-and-cut code for mixed integer programs
Mathematical Programming. Series A. Series B | 2000-04-03 | Paper |
| scientific article; zbMATH DE number 1416629 (Why is no real title available?) | 2000-03-19 | Paper |
Optimal placement of add/drop multiplexers: Static and dynamic models
European Journal of Operational Research | 1999-07-11 | Paper |
| scientific article; zbMATH DE number 1312984 (Why is no real title available?) | 1999-07-01 | Paper |
The 0-1 knapsack problem with a single continuous variable
Mathematical Programming. Series A. Series B | 1999-06-28 | Paper |
The node capacitated graph partitioning problem: A computational study
Mathematical Programming. Series A. Series B | 1999-06-03 | Paper |
Cutting planes for integer programs with general integer variables
Mathematical Programming. Series A. Series B | 1999-06-03 | Paper |
MIP modelling of changeovers in production planning and scheduling problems
European Journal of Operational Research | 1999-02-22 | Paper |
Progress with single-item lot-sizing
European Journal of Operational Research | 1998-07-14 | Paper |
An exact algorithm for IP column generation
Operations Research Letters | 1997-07-15 | Paper |
Formulations and valid inequalities of the node capacitated graph partitioning problem
Mathematical Programming. Series A. Series B | 1996-10-31 | Paper |
Optimizing constrained subtrees of trees
Mathematical Programming. Series A. Series B | 1996-10-03 | Paper |
A new approach to minimising the frontwidth in finite element calculations
Computer Methods in Applied Mechanics and Engineering | 1996-09-23 | Paper |
| scientific article; zbMATH DE number 795222 (Why is no real title available?) | 1996-06-23 | Paper |
| scientific article; zbMATH DE number 892152 (Why is no real title available?) | 1996-06-23 | Paper |
Capacitated Facility Location: Valid Inequalities and Facets
Mathematics of Operations Research | 1996-02-25 | Paper |
| scientific article; zbMATH DE number 780785 (Why is no real title available?) | 1995-07-31 | Paper |
Polyhedra for lot-sizing with Wagner-Whitin costs
Mathematical Programming. Series A. Series B | 1995-06-11 | Paper |
Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
Mathematics of Operations Research | 1995-03-15 | Paper |
Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
Discrete Applied Mathematics | 1995-01-01 | Paper |
Modelling piecewise linear concave costs in a tree partitioning problem
Discrete Applied Mathematics | 1994-06-08 | Paper |
Polyhedral Characterization of the Economic Lot-Sizing Problem with Start-Up Costs
SIAM Journal on Discrete Mathematics | 1994-05-12 | Paper |
Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
European Journal of Operational Research | 1994-05-05 | Paper |
| scientific article; zbMATH DE number 193411 (Why is no real title available?) | 1993-06-05 | Paper |
A time indexed formulation of non-preemptive single machine scheduling problems
Mathematical Programming. Series A. Series B | 1993-01-16 | Paper |
Valid Inequalities for the Lasdon-Terjung Production Model
The Journal of the Operational Research Society | 1993-01-16 | Paper |
Lot-sizing polyhedra with a cardinality constraint
Operations Research Letters | 1993-01-16 | Paper |
Finding minimum cost directed trees with demands and capacities
Annals of Operations Research | 1992-06-27 | Paper |
A recursive procedure to generate all cuts for 0-1 mixed integer programs
Mathematical Programming. Series A. Series B | 1992-06-25 | Paper |
Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes
Management Science | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4202014 (Why is no real title available?) | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4181112 (Why is no real title available?) | 1990-01-01 | Paper |
Formulating the single machine sequencing problem with release dates as a mixed integer program
Discrete Applied Mathematics | 1990-01-01 | Paper |
Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints
Discrete Applied Mathematics | 1990-01-01 | Paper |
Submodularity and valid inequalities in capacitated fixed charge networks
Operations Research Letters | 1989-01-01 | Paper |
Uncapacitated Lot-Sizing Problems with Start-Up Costs
Operations Research | 1989-01-01 | Paper |
Strong formulations for mixed integer programming: A survey
Mathematical Programming. Series A. Series B | 1989-01-01 | Paper |
Lot-size models with backlogging: Strong reformulations and cutting planes
Mathematical Programming. Series A. Series B | 1988-01-01 | Paper |
Solving Mixed Integer Programming Problems Using Automatic Reformulation
Operations Research | 1987-01-01 | Paper |
Valid Linear Inequalities for Fixed Charge Problems
Operations Research | 1985-01-01 | Paper |
Valid inequalities and separation for uncapacitated fixed charge networks
Operations Research Letters | 1985-01-01 | Paper |
Sensitivity Analysis for Branch and Bound Integer Programming
Operations Research | 1985-01-01 | Paper |
Uncapacitated lot-sizing: The convex hull of solutions
Mathematical Programming Studies | 1984-01-01 | Paper |
Fractional covers for forests and matchings
Mathematical Programming | 1984-01-01 | Paper |
Strong Formulations for Multi-Item Capacitated Lot Sizing
Management Science | 1984-01-01 | Paper |
Trees and Cuts
Combinatorial Mathematics, Proceedings of the International Colloquium on Graph Theory and Combinatorics | 1983-01-01 | Paper |
An analysis of the greedy algorithm for the submodular set covering problem
Combinatorica | 1982-01-01 | Paper |
On the Greedy Heuristic for Continuous Covering and Packing Problems
SIAM Journal on Algebraic Discrete Methods | 1982-01-01 | Paper |
Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems
Mathematics of Operations Research | 1982-01-01 | Paper |
On the use of penumbras in blocking and antiblocking theory
Mathematical Programming | 1982-01-01 | Paper |
Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
North-Holland Mathematics Studies | 1981-01-01 | Paper |
A resource decomposition algorithm for general mathematical programs
Mathematical Programming Studies | 1981-01-01 | Paper |
Integer programming duality: Price functions and sensitivity analysis
Mathematical Programming | 1981-01-01 | Paper |
An elementary survey of general duality theory in mathematical programming
Mathematical Programming | 1981-01-01 | Paper |
The b-hull of an integer program
Discrete Applied Mathematics | 1981-01-01 | Paper |
A Canonical Representation of Simple Plant Location Problems and Its Applications
SIAM Journal on Algebraic Discrete Methods | 1980-01-01 | Paper |
Heuristic analysis, linear programming and branch and bound
Mathematical Programming Studies | 1980-01-01 | Paper |
Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem
Operations Research | 1980-01-01 | Paper |
An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit
Operations Research | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3635849 (Why is no real title available?) | 1978-01-01 | Paper |
Best Algorithms for Approximating the Maximum of a Submodular Set Function
Mathematics of Operations Research | 1978-01-01 | Paper |
An analysis of approximations for maximizing submodular set functions—I
Mathematical Programming | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3573595 (Why is no real title available?) | 1977-01-01 | Paper |
Valid Inequalities and Superadditivity for 0–1 Integer Programs
Mathematics of Operations Research | 1977-01-01 | Paper |
Cubical Sperner lemmas as applications of generalized complementary pivoting
Journal of Combinatorial Theory. Series A | 1977-01-01 | Paper |
The nucleolus and kernel for simple games or special valid inequalities for 0-1 linear integer programs
International Journal of Game Theory | 1976-01-01 | Paper |
Technical Note—Facets and Strong Valid Inequalities for Integer Programs
Operations Research | 1976-01-01 | Paper |
Further facet generating procedures for vertex packing polytopes
Mathematical Programming | 1976-01-01 | Paper |
Faces for a linear inequality in 0–1 variables
Mathematical Programming | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3470175 (Why is no real title available?) | 1974-01-01 | Paper |
| scientific article; zbMATH DE number 3502992 (Why is no real title available?) | 1974-01-01 | Paper |
A number theoretic reformulation and decomposition method for integer programming
Discrete Mathematics | 1974-01-01 | Paper |
Coefficient reduction for inequalities in 0–1 variables
Mathematical Programming | 1974-01-01 | Paper |
Generalized dynamic programming methods in integer programming
Mathematical Programming | 1973-01-01 | Paper |
Relaxation Methods for Pure and Mixed Integer Programming Problems
Management Science | 1972-01-01 | Paper |
Group-Theoretic Results in Mixed Integer Programming
Operations Research | 1971-01-01 | Paper |
Extensions of the Group Theoretic Approach in Integer Programming
Management Science | 1971-01-01 | Paper |
