Laurence A. Wolsey

Lara Scavuzzo

Oper. Res. Lett., July, 2023

Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing.

[BibT_eX]

[DOI]

Dieter Weninger

Eur. J. Oper. Res., 2023

2022

Improved models for a single vehicle continuous-time inventory routing problem with pickups and deliveries.

[BibT_eX]

[DOI]

Agostinho Agra

Marielle Christiansen

Eur. J. Oper. Res., 2022

2021

Lattice Reformulation Cuts.

[BibT_eX]

[DOI]

SIAM J. Optim., 2021

Convex hull results for generalizations of the constant capacity single node flow set.

[BibT_eX]

[DOI]

Math. Program., 2021

2020

On the Balanced Minimum Evolution polytope.

[BibT_eX]

[DOI]

Daniele Catanzaro

Raffaele Pesenti

Discret. Optim., 2020

2019

"Facet" separation with one linear program.

[BibT_eX]

[DOI]

Vinasétan Ratheil Houndji

Math. Program., 2019

The item dependent stockingcost constraint.

[BibT_eX]

[DOI]

Pierre Schaus

Constraints An Int. J., 2019

2018

Single-Period Cutting Planes for Inventory Routing Problems.

[BibT_eX]

[DOI]

Pasquale Avella

Maurizio Boccia

Transp. Sci., 2018

Optimum turn-restricted paths, nested compatibility, and optimum convex polygons.

[BibT_eX]

[DOI]

Maurice Queyranne

J. Comb. Optim., 2018

Convex hull results for the warehouse problem.

[BibT_eX]

[DOI]

Discret. Optim., 2018

2017

Erratum: A tight formulation for uncapacitated lot-sizing with stock upper bounds.

[BibT_eX]

[DOI]

Math. Program., 2017

Tight MIP formulations for bounded up/down times and interval-dependent start-ups.

[BibT_eX]

[DOI]

Maurice Queyranne

Vinasétan Ratheil Houndji

Math. Program., 2017

The Weighted Arborescence Constraint.

[BibT_eX]

[DOI]

Pierre Schaus

Mahouton Norbert Hounkonnou

Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2017

2016

Continuous knapsack sets with divisible capacities.

[BibT_eX]

[DOI]

Math. Program., 2016

The continuous knapsack set.

[BibT_eX]

[DOI]

Sanjeeb Dash

Oktay Günlük

Math. Program., 2016

2015

Single-item reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instances.

[BibT_eX]

[DOI]

Pasquale Avella

Maurizio Boccia

Networks, 2015

Sufficiency of cut-generating functions.

[BibT_eX]

[DOI]

Gérard Cornuéjols

Sercan Yildiz

Math. Program., 2015

Modeling Poset Convex Subsets.

[BibT_eX]

Maurice Queyranne

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014

Relaxations for two-level multi-item lot-sizing problems.

[BibT_eX]

[DOI]

Mathieu Van Vyve

Vinasétan Ratheil Houndji

Math. Program., 2014

Covering Linear Programming with Violations.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2014

On the Practical Strength of Two-Row Tableau Cuts.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2014

The StockingCost Constraint.

[BibT_eX]

[DOI]

Pierre Schaus

Yves Deville

Proceedings of the Principles and Practice of Constraint Programming, 2014

An efficient technique for solving the scheduling of appliances in smart-homes.

[BibT_eX]

[DOI]

Julien M. Hendrickx

Raphaël M. Jungers

Guillaume Vankeerberghen

Proceedings of the American Control Conference, 2014

2013

A maritime inventory routing problem: Discrete time formulations and valid inequalities.

[BibT_eX]

[DOI]

Agostinho Agra

Henrik Andersson

Marielle Christiansen

Networks, 2013

Strong and compact relaxations in the original space using a compact extended formulation.

[BibT_eX]

[DOI]

Mathieu Van Vyve

EURO J. Comput. Optim., 2013

2012

On discrete lot-sizing and scheduling on identical parallel machines.

[BibT_eX]

[DOI]

Céline Gicquel

Michel Minoux

Optim. Lett., 2012

MIP formulations and heuristics for two-level production-transportation problems.

[BibT_eX]

[DOI]

Rafael A. Melo

Comput. Oper. Res., 2012

2011

Mixing Sets Linked by Bidirected Paths.

[BibT_eX]

[DOI]

SIAM J. Optim., 2011

Erratum: Lot-Sizing with Stock Upper Bounds and Fixed Charges.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2011

2010

Constrained Infinite Group Relaxations of MIPs.

[BibT_eX]

[DOI]

SIAM J. Optim., 2010

Lot-Sizing with Stock Upper Bounds and Fixed Charges.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

Uncapacitated two-level lot-sizing.

[BibT_eX]

[DOI]

Rafael A. Melo

Oper. Res. Lett., 2010

Single item lot-sizing with non-decreasing capacities.

[BibT_eX]

[DOI]

Math. Program., 2010

Traces of the XII Aussois Workshop on Combinatorial Optimization.

[BibT_eX]

[DOI]

Michael Jünger

Thomas M. Liebling

Denis Naddef

William R. Pulleyblank

Gerhard Reinelt

Giovanni Rinaldi

Math. Program., 2010

Two row mixed-integer cuts via lifting.

[BibT_eX]

[DOI]

Math. Program., 2010

Lattice based extended formulations for integer linear equality systems.

[BibT_eX]

[DOI]

Math. Program., 2010

Projecting an Extended Formulation for Mixed-Integer Covers on Bipartite Graphs.

[BibT_eX]

[DOI]

Giacomo Zambelli

Math. Oper. Res., 2010

Optimizing production and transportation in a commit-to-delivery business mode.

[BibT_eX]

[DOI]

Rafael A. Melo

Eur. J. Oper. Res., 2010

Composite lifting of group inequalities and an application to two-row mixing inequalities.

[BibT_eX]

[DOI]

Discret. Optim., 2010

Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times.

[BibT_eX]

[DOI]

Nadjib Brahimi

Stéphane Dauzère-Pérès

Comput. Oper. Res., 2010

Experiments with Two Row Tableau Cuts.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2010

Reformulation and Decomposition of Integer Programs.

[BibT_eX]

[DOI]

François Vanderbeck

Proceedings of the 50 Years of Integer Programming 1958-2008, 2010

2009

Two "well-known" properties of subgradient optimization.

[BibT_eX]

[DOI]

Kurt M. Anstreicher

Math. Program., 2009

Multi-item lot-sizing with joint set-up costs.

[BibT_eX]

[DOI]

Shoshana Anily

Michal Tzur

Math. Program., 2009

Network Formulations of Mixed-Integer Programs.

[BibT_eX]

[DOI]

Math. Oper. Res., 2009

2008

Mixed Integer Programming.

[BibT_eX]

[DOI]

Proceedings of the Wiley Encyclopedia of Computer Science and Engineering, 2008

Lot-sizing on a tree.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2008

Compact formulations as a union of polyhedra.

[BibT_eX]

[DOI]

Math. Program., 2008

Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2008

The Mixing Set with Divisible Capacities.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2008

2007

The Mixing Set with Flows.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2007

The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2007

Inequalities from Two Rows of a Simplex Tableau.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2007

2006

Lot-sizing with production and delivery time windows.

[BibT_eX]

[DOI]

Math. Program., 2006

Approximate extended formulations.

[BibT_eX]

[DOI]

Mathieu Van Vyve

Math. Program., 2006

Combinatorial Optimization: Theory and Computation The Aussois Workshop 2004.

[BibT_eX]

[DOI]

Thomas M. Liebling

Denis Naddef

Math. Program., 2006

Integer Programming and Constraint Programming in Solving a Multimachine Assignment Scheduling Problem with Deadlines and Release Dates.

[BibT_eX]

[DOI]

Ruslan Sadykov

INFORMS J. Comput., 2006

2004

Uncapacitated lot-sizing with buying, sales and backlogging.

[BibT_eX]

[DOI]

Bram Verweij

Optim. Methods Softw., 2004

On unions and dominants of polytopes.

[BibT_eX]

[DOI]

Math. Program., 2004

On the cut polyhedron.

[BibT_eX]

[DOI]

Giovanni Rinaldi

Discret. Math., 2004

Extended formulations for Gomory Corner polyhedra.

[BibT_eX]

[DOI]

Discret. Optim., 2004

Time for Old and New Faces.

[BibT_eX]

[DOI]

Proceedings of the Sharpest Cut, 2004

2003

A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem.

[BibT_eX]

[DOI]

Francisco Ortega

Networks, 2003

Strong formulations for mixed integer programs: valid inequalities and extended formulations.

[BibT_eX]

[DOI]

Math. Program., 2003

Tight formulations for some simple mixed integer programs and convex objective integer programs.

[BibT_eX]

[DOI]

Andrew J. Miller

Math. Program., 2003

Dynamic knapsack sets and capacitated lot-sizing.

[BibT_eX]

[DOI]

Marko Loparic

Hugues Marchand

Math. Program., 2003

The Aussois 2000 workshop in combinatorial optimization introduction.

[BibT_eX]

[DOI]

Thomas M. Liebling

Denis Naddef

Math. Program., 2003

Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems.

[BibT_eX]

[DOI]

Andrew J. Miller

Oper. Res., 2003

Lifting, superadditivity, mixed integer rounding and single node flow sets revisited.

[BibT_eX]

[DOI]

Quentin Louveaux

4OR, 2003

2002

Combining Problem Structure with Basis Reduction to Solve a Class of Hard Integer Programs.

[BibT_eX]

[DOI]

Quentin Louveaux

Math. Oper. Res., 2002

Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation.

[BibT_eX]

[DOI]

Manag. Sci., 2002

Cutting planes in integer and mixed integer programming.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

Non-standard approaches to integer programming.

[BibT_eX]

[DOI]

Robert Weismantel

Discret. Appl. Math., 2002

A rendezvous point selection algorithm for videoconferencing applications.

[BibT_eX]

[DOI]

Jean-François Macq

Benoît Macq

Proceedings of the 2002 IEEE International Conference on Multimedia and Expo, 2002

2001

The uncapacitated lot-sizing problem with sales and safety stocks.

[BibT_eX]

[DOI]

Marko Loparic

Math. Program., 2001

On the Wagner-Whitin Lot-Sizing Polyhedron.

[BibT_eX]

[DOI]

Olivier Pereira

Math. Oper. Res., 2001

Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs.

[BibT_eX]

[DOI]

Gaetan Belvaux

Manag. Sci., 2001

Aggregation and Mixed Integer Rounding to Solve MIPs.

[BibT_eX]

[DOI]

Hugues Marchand

Cristina C. B. Cavalcante

Oper. Res., 2001

Scheduling projects with labor constraints.

[BibT_eX]

[DOI]

C. Carvalho de Souza

Martin W. P. Savelsbergh

Y. Wang

Discret. Appl. Math., 2001

1999

The 0-1 Knapsack problem with a single continuous variable.

[BibT_eX]

[DOI]

Hugues Marchand

Math. Program., 1999

<i>bc</i> - <i>opt</i> : a branch-and-cut code for mixed integer programs.

[BibT_eX]

[DOI]

Math. Program., 1999

1998

The node capacitated graph partitioning problem: A computational study.

[BibT_eX]

[DOI]

Carlos Eduardo Ferreira

Math. Program., 1998

Cutting planes for integer programs with general integer variables.

[BibT_eX]

[DOI]

Math. Program., 1998

Optimal Placement of Add/Drop Multiplexers: Heuristic and Exact Algorithms.

[BibT_eX]

[DOI]

Alain S. Sutter

François Vanderbeck

Oper. Res., 1998

Optimal placement of add /drop multiplexers static and dynamic models.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 1998

1997

Decomposition of Integer Programs and of Generating Sets.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1997

1996

An exact algorithm for IP column generation.

[BibT_eX]

[DOI]

François Vanderbeck

Oper. Res. Lett., 1996

Formulations and valid inequalities for the node capacitated graph partitioning problem.

[BibT_eX]

[DOI]

Carlos Eduardo Ferreira

Math. Program., 1996

1995

Optimizing constrained subtrees of trees.

[BibT_eX]

[DOI]

El Houssaine Aghezzaf

Thomas L. Magnanti

Math. Program., 1995

Capacitated Facility Location: Valid Inequalities and Facets.

[BibT_eX]

[DOI]

Math. Oper. Res., 1995

Integer Knapsack and Flow Covers with Divisible Coefficients: Polyhedra, optimization and Separation.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1995

1994

Polyhedral Characterization of the Economic Lot-Sizing Problem with Start-Up Costs.

[BibT_eX]

[DOI]

C. P. M. van Hoesel

Albert P. M. Wagelmans

SIAM J. Discret. Math., 1994

Polyhedra for lot-sizing with Wagner-Whitin costs.

[BibT_eX]

[DOI]

Math. Program., 1994

Modelling piecewise linear concave costs in a tree partitioning problem.

[BibT_eX]

[DOI]

El Houssaine Aghezzaf

Discret. Appl. Math., 1994

1993

Lot-Sizing with Constant Batches: Formulation and Valid Inequalities.

[BibT_eX]

[DOI]

Math. Oper. Res., 1993

Non-Deterministic Heuristics for Automatic Domain Decomposition in Direct Parallel Finite Element Calculations.

[BibT_eX]

Proceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing, 1993

Algorithms and reformulations for lot sizing problems.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization, 1993

1992

Lot-sizing polyhedra with a cardinality constraint.

[BibT_eX]

[DOI]

El Houssaine Aghezzaf

Oper. Res. Lett., 1992

A time indexed formulation of non-preemptive single machine scheduling problems.

[BibT_eX]

[DOI]

Jorge P. Sousa

Math. Program., 1992

Book review.

[BibT_eX]

[DOI]

ZOR Methods Model. Oper. Res., 1992

Network Design with Divisible Capacities: Aggregated Flow and Knapsack Subproblems.

[BibT_eX]

Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 1992

1991

Finding minimum cost directed trees with demands and capacities.

[BibT_eX]

[DOI]

Choaib Bousba

Ann. Oper. Res., 1991

1990

A Recursive Procedure to Generate All Cuts for 0-1 Mixed Integer Programs.

[BibT_eX]

[DOI]

Math. Program., 1990

Valid inequalities for 0-1 knapsacks and mips with generalised upper bound constraints.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1990

Formulating the single machine sequencing problem with release dates as a mixed integer program.

[BibT_eX]

[DOI]

Martin E. Dyer

Discret. Appl. Math., 1990

1989

Strong formulations for mixed integer programming: A survey.

[BibT_eX]

[DOI]

Math. Program., 1989

Uncapacitated Lot-Sizing Problems with Start-Up Costs.

[BibT_eX]

[DOI]

Oper. Res., 1989

1988

Lot-size models with backlogging: Strong reformulations and cutting planes.

[BibT_eX]

[DOI]

Math. Program., 1988

Integer and Combinatorial Optimization.

[BibT_eX]

[DOI]

Wiley interscience series in discrete mathematics and optimization, Wiley, ISBN: 978-1-118-62737-2, 1988

1987

Solving Mixed Integer Programming Problems Using Automatic Reformulation.

[BibT_eX]

[DOI]

Tony J. Van Roy

Oper. Res., 1987

1986

Valid inequalities for mixed 0-1 programs.

[BibT_eX]

[DOI]

Tony J. Van Roy

Discret. Appl. Math., 1986

Packing and covering a tree by subtrees.

[BibT_eX]

[DOI]

Imre Bárány

Jack Edmonds

Comb., 1986

1985

Sensitivity Analysis for Branch and Bound Integer Programming.

[BibT_eX]

[DOI]

Linus Schrage

Oper. Res., 1985

Valid Linear Inequalities for Fixed Charge Problems.

[BibT_eX]

[DOI]

Manfred W. Padberg

Tony J. Van Roy

Oper. Res., 1985

1984

Fractional covers for forests and matchings.

[BibT_eX]

[DOI]

Manfred Padberg

Math. Program., 1984

1982

On the use of penumbras in blocking and antiblocking theory.

[BibT_eX]

[DOI]

Jørgen Tind

Math. Program., 1982

Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems.

[BibT_eX]

[DOI]

Math. Oper. Res., 1982

An analysis of the greedy algorithm for the submodular set covering problem.

[BibT_eX]

[DOI]

Comb., 1982

1981

Integer programming duality: Price functions and sensitivity analysis.

[BibT_eX]

[DOI]

Math. Program., 1981

An elementary survey of general duality theory in mathematical programming.

[BibT_eX]

[DOI]

Jørgen Tind

Math. Program., 1981

The b-hull of an integer program.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1981

1980

A Canonical Representation of Simple Plant Location Problems and Its Applications.

[BibT_eX]

[DOI]

Gérard Cornuéjols

SIAM J. Algebraic Discret. Methods, 1980

Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem.

[BibT_eX]

[DOI]

Gérard Cornuéjols

Oper. Res., 1980

1979

An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit.

[BibT_eX]

[DOI]

Marshall L. Fisher

Oper. Res., 1979

1978

An analysis of approximations for maximizing submodular set functions - I.

[BibT_eX]

[DOI]

Marshall L. Fisher

Math. Program., 1978

Best Algorithms for Approximating the Maximum of a Submodular Set Function.

[BibT_eX]

[DOI]

Math. Oper. Res., 1978

1977

Valid Inequalities and Superadditivity for 0-1 Integer Programs.

[BibT_eX]

[DOI]

Math. Oper. Res., 1977

Cubical Sperner Lemmas as Applications of Generalized Complementary Pivoting.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1977

1976

Further facet generating procedures for vertex packing polytopes.

[BibT_eX]

[DOI]

Math. Program., 1976

Technical Note - Facets and Strong Valid Inequalities for Integer Programs.

[BibT_eX]

[DOI]

Oper. Res., 1976

1975

Faces for a linear inequality in 0-1 variables.

[BibT_eX]

[DOI]

Math. Program., 1975

1974

Coefficient reduction for inequalities in 0-1 variables.

[BibT_eX]

[DOI]

Gordon H. Bradley

Peter L. Hammer

Math. Program., 1974

A number theoretic reformulation and decomposition method for integer programming.

[BibT_eX]

[DOI]

Discret. Math., 1974

1973

Generalized dynamic programming methods in integer programming.

[BibT_eX]

[DOI]

Math. Program., 1973

1971

Group-Theoretic Results in Mixed Integer Programming.

[BibT_eX]

[DOI]