| Publication | Date of Publication | Type |
|---|
| A study of lattice reformulations for integer programming | 2023-09-12 | Paper |
| Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing | 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 | 2021-11-09 | Paper |
| Lattice Reformulation Cuts | 2021-11-05 | Paper |
| Convex hull results for generalizations of the constant capacity single node flow set | 2021-04-23 | Paper |
| Integer Programming | 2020-10-28 | Paper |
| On the balanced minimum evolution polytope | 2020-07-30 | Paper |
| The item dependent stockingcost constraint | 2019-11-27 | Paper |
| ``Facet separation with one linear program | 2019-10-22 | Paper |
| Erratum: ``Submodularity and valid inequalities in capacitated fixed charge networks | 2019-07-22 | Paper |
| Convex hull results for the warehouse problem | 2019-01-14 | Paper |
| Optimum turn-restricted paths, nested compatibility, and optimum convex polygons | 2018-07-26 | Paper |
| Single‐item reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instances | 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 | 2017-07-21 | Paper |
| LS-LIB: A Library of Tools for Solving Production Planning Problems | 2017-04-07 | Paper |
| On the Practical Strength of Two-Row Tableau Cuts | 2017-02-17 | Paper |
| Erratum: a tight formulation for uncapacitated lot-sizing with stock upper bounds | 2017-02-03 | Paper |
| A maritime inventory routing problem: Discrete time formulations and valid inequalities | 2016-06-10 | Paper |
| Continuous knapsack sets with divisible capacities | 2016-04-04 | Paper |
| The continuous knapsack set | 2016-02-23 | Paper |
| Sufficiency of cut-generating functions | 2015-08-31 | Paper |
| Covering Linear Programming with Violations | 2015-01-27 | Paper |
| Strong and compact relaxations in the original space using a compact extended formulation | 2014-09-30 | Paper |
| Relaxations for two-level multi-item lot-sizing problems | 2014-08-29 | Paper |
| On discrete lot-sizing and scheduling on identical parallel machines | 2012-11-30 | Paper |
| MIP formulations and heuristics for two-level production-transportation problems | 2012-11-15 | Paper |
| Composite lifting of group inequalities and an application to two-row mixing inequalities | 2012-06-20 | Paper |
| Integer Programming and Constraint Programming in Solving a Multimachine Assignment Scheduling Problem with Deadlines and Release Dates | 2012-06-18 | Paper |
| Mixing Sets Linked by Bidirected Paths | 2012-03-16 | Paper |
| Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs | 2012-02-19 | Paper |
| Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation | 2012-02-19 | Paper |
| bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems | 2012-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3109953 | 2012-01-26 | Paper |
| Erratum: Lot-Sizing with Stock Upper Bounds and Fixed Charges | 2011-10-27 | Paper |
| Lot-Sizing with Stock Upper Bounds and Fixed Charges | 2011-06-17 | Paper |
| Network Formulations of Mixed-Integer Programs | 2011-04-27 | Paper |
| Projecting an Extended Formulation for Mixed-Integer Covers on Bipartite Graphs | 2011-04-27 | Paper |
| Constrained Infinite Group Relaxations of MIPs | 2011-03-21 | Paper |
| Two row mixed-integer cuts via lifting | 2010-09-16 | Paper |
| Traces of the XII Aussois Workshop on combinatorial optimization | 2010-09-16 | Paper |
| Uncapacitated two-level lot-sizing | 2010-09-07 | Paper |
| Experiments with Two Row Tableau Cuts | 2010-06-22 | Paper |
| Reformulation and Decomposition of Integer Programs | 2010-06-03 | Paper |
| Single item lot-sizing with non-decreasing capacities | 2010-02-19 | Paper |
| Lattice based extended formulations for integer linear equality systems | 2010-02-19 | Paper |
| Optimizing production and transportation in a commit-to-delivery business mode | 2009-12-21 | Paper |
| Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times | 2009-10-16 | Paper |
| Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems | 2009-07-09 | Paper |
| Aggregation and Mixed Integer Rounding to Solve MIPs | 2009-07-03 | Paper |
| Two ``well-known properties of subgradient optimization | 2009-05-05 | Paper |
| Multi-item lot-sizing with joint set-up costs | 2009-04-24 | Paper |
| The Mixing Set with Divisible Capacities | 2008-06-10 | Paper |
| Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles | 2008-06-10 | Paper |
| Compact formulations as a union of polyhedra | 2008-06-04 | Paper |
| Lot-sizing on a tree | 2008-05-29 | Paper |
| The Mixing Set with Flows | 2008-05-22 | Paper |
| Lifting, superadditivity, mixed integer rounding and single node flow sets revisited | 2008-03-31 | Paper |
| Inequalities from Two Rows of a Simplex Tableau | 2007-11-29 | Paper |
| The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows | 2007-11-29 | Paper |
| Production Planning by Mixed Integer Programming | 2006-06-14 | Paper |
| Lot-sizing with production and delivery time windows | 2006-06-14 | Paper |
| Combinatorial optimization: Theory and computation. The Aussois Workshop 2004. Introduction | 2006-01-13 | Paper |
| Approximate extended formulations | 2006-01-13 | Paper |
| Combining Problem Structure with Basis Reduction to Solve a Class of Hard Integer Programs | 2005-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5465106 | 2005-08-22 | Paper |
| Extended formulations for Gomory corner polyhedra | 2005-08-22 | Paper |
| Uncapacitated lot-sizing with buying, sales and backlogging | 2005-03-14 | Paper |
| On unions and dominants of polytopes | 2004-07-01 | Paper |
| On the cut polyhedron. | 2004-03-14 | Paper |
| Tight formulations for some simple mixed integer programs and convex objective integer programs | 2004-03-11 | Paper |
| The Aussois 2000 workshop in combinatorial optimization. Introduction | 2003-10-29 | Paper |
| Dynamic knapsack sets and capacitated lot-sizing | 2003-10-29 | Paper |
| Strong formulations for mixed integer programs: valid inequalities and extended formulations | 2003-09-01 | Paper |
| Lifting, superadditivity, mixed integer rounding and single node flow sets revisited | 2003-01-01 | Paper |
| Non-standard approaches to integer programming | 2002-09-17 | Paper |
| Cutting planes in integer and mixed integer programming | 2002-09-17 | Paper |
| Optimal Placement of Add/Drop Multiplexers: Heuristic and Exact Algorithms | 2002-07-01 | Paper |
| Scheduling projects with labor constraints | 2002-02-27 | Paper |
| On the Wagner-Whitin Lot-Sizing Polyhedron | 2001-11-26 | Paper |
| The uncapacitated lot-sizing problem with sales and safety stocks | 2001-10-03 | Paper |
| \(bc\)-\(opt\): A branch-and-cut code for mixed integer programs | 2000-04-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4943600 | 2000-03-19 | Paper |
| Optimal placement of add/drop multiplexers: Static and dynamic models | 1999-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4254875 | 1999-07-01 | Paper |
| The 0-1 knapsack problem with a single continuous variable | 1999-06-28 | Paper |
| Cutting planes for integer programs with general integer variables | 1999-06-03 | Paper |
| The node capacitated graph partitioning problem: A computational study | 1999-06-03 | Paper |
| MIP modelling of changeovers in production planning and scheduling problems | 1999-02-22 | Paper |
| Progress with single-item lot-sizing | 1998-07-14 | Paper |
| An exact algorithm for IP column generation | 1997-07-15 | Paper |
| Formulations and valid inequalities of the node capacitated graph partitioning problem | 1996-10-31 | Paper |
| Optimizing constrained subtrees of trees | 1996-10-03 | Paper |
| A new approach to minimising the frontwidth in finite element calculations | 1996-09-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4845371 | 1996-06-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4880888 | 1996-06-23 | Paper |
| Capacitated Facility Location: Valid Inequalities and Facets | 1996-02-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4840775 | 1995-07-31 | Paper |
| Polyhedra for lot-sizing with Wagner-Whitin costs | 1995-06-11 | Paper |
| Lot-Sizing with Constant Batches: Formulation and Valid Inequalities | 1995-03-15 | Paper |
| Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation | 1995-01-01 | Paper |
| Modelling piecewise linear concave costs in a tree partitioning problem | 1994-06-08 | Paper |
| Polyhedral Characterization of the Economic Lot-Sizing Problem with Start-Up Costs | 1994-05-12 | Paper |
| Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems | 1994-05-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4040221 | 1993-06-05 | Paper |
| Valid Inequalities for the Lasdon-Terjung Production Model | 1993-01-16 | Paper |
| A time indexed formulation of non-preemptive single machine scheduling problems | 1993-01-16 | Paper |
| Lot-sizing polyhedra with a cardinality constraint | 1993-01-16 | Paper |
| Finding minimum cost directed trees with demands and capacities | 1992-06-27 | Paper |
| A recursive procedure to generate all cuts for 0-1 mixed integer programs | 1992-06-25 | Paper |
| Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes | 1991-01-01 | Paper |
| Formulating the single machine sequencing problem with release dates as a mixed integer program | 1990-01-01 | Paper |
| Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3204309 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3351135 | 1990-01-01 | Paper |
| Submodularity and valid inequalities in capacitated fixed charge networks | 1989-01-01 | Paper |
| Strong formulations for mixed integer programming: A survey | 1989-01-01 | Paper |
| Uncapacitated Lot-Sizing Problems with Start-Up Costs | 1989-01-01 | Paper |
| Lot-size models with backlogging: Strong reformulations and cutting planes | 1988-01-01 | Paper |
| Solving Mixed Integer Programming Problems Using Automatic Reformulation | 1987-01-01 | Paper |
| Valid Linear Inequalities for Fixed Charge Problems | 1985-01-01 | Paper |
| Sensitivity Analysis for Branch and Bound Integer Programming | 1985-01-01 | Paper |
| Valid inequalities and separation for uncapacitated fixed charge networks | 1985-01-01 | Paper |
| Strong Formulations for Multi-Item Capacitated Lot Sizing | 1984-01-01 | Paper |
| Fractional covers for forests and matchings | 1984-01-01 | Paper |
| Uncapacitated lot-sizing: The convex hull of solutions | 1984-01-01 | Paper |
| Trees and Cuts | 1983-01-01 | Paper |
| On the use of penumbras in blocking and antiblocking theory | 1982-01-01 | Paper |
| Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems | 1982-01-01 | Paper |
| On the Greedy Heuristic for Continuous Covering and Packing Problems | 1982-01-01 | Paper |
| An analysis of the greedy algorithm for the submodular set covering problem | 1982-01-01 | Paper |
| A resource decomposition algorithm for general mathematical programs | 1981-01-01 | Paper |
| Integer programming duality: Price functions and sensitivity analysis | 1981-01-01 | Paper |
| An elementary survey of general duality theory in mathematical programming | 1981-01-01 | Paper |
| Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms | 1981-01-01 | Paper |
| The b-hull of an integer program | 1981-01-01 | Paper |
| Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem | 1980-01-01 | Paper |
| Heuristic analysis, linear programming and branch and bound | 1980-01-01 | Paper |
| A Canonical Representation of Simple Plant Location Problems and Its Applications | 1980-01-01 | Paper |
| An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit | 1979-01-01 | Paper |
| An analysis of approximations for maximizing submodular set functions—I | 1978-01-01 | Paper |
| Best Algorithms for Approximating the Maximum of a Submodular Set Function | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4196269 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4145427 | 1977-01-01 | Paper |
| Valid Inequalities and Superadditivity for 0–1 Integer Programs | 1977-01-01 | Paper |
| Cubical Sperner lemmas as applications of generalized complementary pivoting | 1977-01-01 | Paper |
| Technical Note—Facets and Strong Valid Inequalities for Integer Programs | 1976-01-01 | Paper |
| Further facet generating procedures for vertex packing polytopes | 1976-01-01 | Paper |
| The nucleolus and kernel for simple games or special valid inequalities for 0-1 linear integer programs | 1976-01-01 | Paper |
| Faces for a linear inequality in 0–1 variables | 1975-01-01 | Paper |
| Coefficient reduction for inequalities in 0–1 variables | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4054818 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4083208 | 1974-01-01 | Paper |
| A number theoretic reformulation and decomposition method for integer programming | 1974-01-01 | Paper |
| Generalized dynamic programming methods in integer programming | 1973-01-01 | Paper |
| Relaxation Methods for Pure and Mixed Integer Programming Problems | 1972-01-01 | Paper |
| Group-Theoretic Results in Mixed Integer Programming | 1971-01-01 | Paper |
| Extensions of the Group Theoretic Approach in Integer Programming | 1971-01-01 | Paper |
