| Publication | Date of Publication | Type |
|---|
| An exact algorithm for the service network design problem with hub capacity constraints | 2023-12-12 | Paper |
| A linear programming based approach to the Steiner tree problem with a fixed number of terminals | 2023-11-13 | Paper |
| Decomposition of loosely coupled integer programs: a multiobjective perspective | 2022-11-14 | Paper |
| Sequence independent lifting of cover inequalities | 2022-08-30 | Paper |
| Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems | 2022-06-30 | Paper |
| State-Variable Modeling for a Class of Two-Stage Stochastic Optimization Problems | 2022-06-28 | Paper |
| Time-Dependent Shortest Path Problems with Penalties and Limits on Waiting | 2022-06-27 | Paper |
| Decentralized online integer programming problems with a coupling cardinality constraint | 2022-03-09 | Paper |
| Decentralized algorithms for distributed integer programming problems with a coupling cardinality constraint | 2021-01-15 | Paper |
| A Simulated Annealing Algorithm for the Directed Steiner Tree Problem | 2020-02-07 | Paper |
| Tailoring parallel alternating criteria search for domain specific MIPs: application to maritime inventory routing | 2019-09-25 | Paper |
| A dynamic discretization discovery algorithm for the minimum duration time-dependent shortest path problem | 2018-11-21 | Paper |
| How important are branching decisions: fooling MIP solvers | 2018-09-28 | Paper |
| A dual heuristic for mixed integer programming | 2018-09-28 | Paper |
| A parallel local search framework for the fixed-charge multicommodity network flow problem | 2018-07-11 | Paper |
| Flexible solutions to maritime inventory routing problems with delivery time windows | 2018-07-11 | Paper |
| Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs | 2018-02-06 | Paper |
| A hybrid primal heuristic for finding feasible solutions to mixed integer programs | 2018-02-06 | Paper |
| An abstract model for branching and its application to mixed integer programming | 2017-12-01 | Paper |
| Erratum to: ``An abstract model for branching and its application to mixed integer programming | 2017-12-01 | Paper |
| Comments on: ``On learning and branching: a survey | 2017-10-12 | Paper |
| A branch-and-price guided search approach to maritime inventory routing | 2017-01-05 | Paper |
| Pricing for production and delivery flexibility in single-item lot-sizing | 2016-11-11 | Paper |
| On the Computational Complexity of Minimum-Concave-Cost Flow in a Two-Dimensional Grid | 2016-10-25 | Paper |
| The Fixed-Charge Shortest-Path Problem | 2016-06-29 | Paper |
| Scheduling and Routing of Fly-in Safari Planes Using a Flow-over-Flow Model | 2015-07-22 | Paper |
| Minimum concave cost flow over a grid network | 2015-04-16 | Paper |
| MIRPLib -- a library of maritime inventory routing problem instances: survey, core model, and benchmark results | 2015-02-19 | Paper |
| Two-Stage Decomposition Algorithms for Single Product Maritime Inventory Routing | 2015-01-26 | Paper |
| Restrict-and-relax search for 0-1 mixed-integer programs | 2014-09-30 | Paper |
| A cutting and scheduling problem in float glass manufacturing | 2014-08-18 | Paper |
| Column generation for linear and integer programming | 2013-04-17 | Paper |
| Branch-and-Price Guided Search | 2012-11-02 | Paper |
| Mixed integer linear programming formulations for probabilistic constraints | 2012-08-17 | Paper |
| Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem | 2012-07-28 | Paper |
| A Note on “A Superior Representation Method for Piecewise Linear Functions” | 2012-07-28 | Paper |
| Dynamic Programming-Based Column Generation on Time-Expanded Networks: Application to the Dial-a-Flight Problem | 2012-07-28 | Paper |
| Lifted Tableaux Inequalities for 0–1 Mixed-Integer Programs: A Computational Study | 2012-07-28 | Paper |
| A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs | 2012-07-28 | Paper |
| Sell or hold: A simple two-stage stochastic combinatorial optimization problem | 2012-07-12 | Paper |
| The value function of an infinite-horizon single-item lot-sizing problem | 2012-07-06 | Paper |
| A Branch-Price-and-Cut Algorithm for Single-Product Maritime Inventory Routing | 2012-06-18 | Paper |
| Discrete Dynamic Programming and Capital Allocation | 2012-02-12 | Paper |
| A Probabilistic Comparison of Split and Type 1 Triangle Cuts for Two-Row Mixed-Integer Programs | 2012-01-09 | Paper |
| Strategic Planning with Start-Time Dependent Variable Costs | 2011-11-24 | Paper |
| Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions | 2011-11-24 | Paper |
| Modeling disjunctive constraints with a logarithmic number of binary variables and constraints | 2011-06-17 | Paper |
| Hooked on IP | 2011-05-20 | Paper |
| Decomposing inventory routing problems with approximate value functions | 2011-01-06 | Paper |
| Cutting Planes for Multistage Stochastic Integer Programs | 2010-03-06 | Paper |
| Information-based branching schemes for binary linear mixed integer problems | 2010-03-01 | Paper |
| An integer programming approach for linear programs with probabilistic constraints | 2010-02-19 | Paper |
| Approximating the stability region for binary mixed-integer programs | 2009-08-14 | Paper |
| A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization | 2009-08-13 | Paper |
| George Dantzig's contributions to integer programming | 2008-10-29 | Paper |
| Nonconvex, lower semicontinuous piecewise linear optimization | 2008-10-29 | Paper |
| Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints | 2008-06-10 | Paper |
| An optimization approach for planning daily drayage operations | 2008-05-27 | Paper |
| Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements | 2008-05-16 | Paper |
| Sequential pairing of mixed integer inequalities | 2008-02-22 | Paper |
| An Integer Programming Approach for Linear Programs with Probabilistic Constraints | 2007-11-29 | Paper |
| Sequential Pairing of Mixed Integer Inequalities | 2007-08-30 | Paper |
| Improving airline operational performance through schedule perturbation | 2007-02-15 | Paper |
| Analysis of bounds for a capacitated single-item lot-sizing problem | 2007-01-09 | Paper |
| Short-term booking of air cargo space | 2006-09-14 | Paper |
| On formulations of the stochastic uncapacitated lot-sizing problem | 2006-06-30 | Paper |
| A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem | 2006-01-13 | Paper |
| The 2-edge-connected subgraph polyhedron | 2005-12-14 | Paper |
| Facets of the Complementarity Knapsack Polytope | 2005-11-11 | Paper |
| A Polyhedral Study of Integer Variable Upper Bounds | 2005-11-11 | Paper |
| A polyhedral study of nonconvex quadratic programs with box constraints | 2005-04-29 | Paper |
| A branch-and-cut algorithm for nonconvex quadratic programs with box constraints | 2005-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4667441 | 2005-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737525 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737534 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4475665 | 2004-08-09 | Paper |
| Models for representing piecewise linear cost functions | 2004-07-01 | Paper |
| Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms | 2004-03-11 | Paper |
| Lifted inequalities for 0-1 mixed integer programming: superlinear lifting | 2004-03-11 | Paper |
| The mixed vertex packing problem. | 2004-02-18 | Paper |
| Lifted Cover Inequalities for 0-1 Integer Programs: Complexity | 2003-12-16 | Paper |
| Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition | 2003-11-06 | Paper |
| On the polyhedral structure of a multi-item production planning model with setup times | 2003-10-29 | Paper |
| A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case | 2003-10-29 | Paper |
| A polyhedral study of the cardinality constrained knapsack problem | 2003-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414645 | 2003-07-25 | Paper |
| Airline Crew Scheduling with Time Windows and Plane-Count Constraints | 2003-06-29 | Paper |
| A Stochastic Model of Airline Operations | 2003-06-29 | Paper |
| Dynamic network flow with uncertain arc capacities: Decomposition algorithm and computational results | 2003-04-22 | Paper |
| The sample average approximation method applied to stochastic routing problems: a computational study | 2003-04-03 | Paper |
| Price-Directed Control of Remnant Inventory Systems | 2002-11-05 | Paper |
| Airline Crew Recovery | 2002-10-17 | Paper |
| A parallel primal-dual simplex algorithm | 2002-07-22 | Paper |
| An Optimization Based Heuristic for Political Districting | 2002-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4537752 | 2002-06-20 | Paper |
| A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure | 2002-06-04 | Paper |
| Valid inequalities for problems with additive variable upper bounds | 2002-05-27 | Paper |
| Flight String Models for Aircraft Fleeting and Routing | 2002-04-17 | Paper |
| Solving large airline crew scheduling problems: Random pairing generation and strong branching | 2002-04-07 | Paper |
| Branch-and-Price: Column Generation for Solving Huge Integer Programs | 2002-02-07 | Paper |
| A family of inequalities for the generalized assignment polytope | 2001-12-05 | Paper |
| Sequence independent lifting in mixed integer programming | 2001-07-19 | Paper |
| A generalized assignment problem with special ordered sets: a polyhedral approach. | 2001-07-02 | Paper |
| Conflict graphs in solving integer programming problems | 2001-05-02 | Paper |
| The complexity of cover inequality separation | 2001-04-02 | Paper |
| Airline Crew Scheduling with Regularity | 2001-01-01 | Paper |
| Branch-and-cut for combinatorial optimization problems without auxiliary binary variables | 2001-01-01 | Paper |
| Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs | 2000-11-12 | Paper |
| On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra | 2000-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4943600 | 2000-03-19 | Paper |
| The asymmetric traveling salesman problem with replenishment arcs | 2000-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263702 | 1999-11-21 | Paper |
| Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case | 1999-04-27 | Paper |
| Polyhedral characterizations and perfection of line graphs | 1998-12-10 | Paper |
| Airline Crew Scheduling: A New Formulation and Decomposition Algorithm | 1997-11-25 | Paper |
| Maintenance and Crew Considerations in Fleet Assignment | 1997-10-30 | Paper |
| The aircraft rotation problem | 1997-06-16 | Paper |
| A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems | 1996-09-01 | Paper |
| The fleet assignment problem: Solving a large scale integer program | 1996-02-06 | Paper |
| Lifted cover facets of the 0-1 knapsack polytope with GUB constraints | 1995-06-25 | Paper |
| Recent developments and future directions in mathematical programming | 1995-02-20 | Paper |
| MINTO, a Mixed INTeger Optimizer | 1995-02-19 | Paper |
| Some properties of the fleet assignment problem | 1994-09-05 | Paper |
| Experiments with parallel branch-and-bound algorithms for the set covering problem | 1994-06-26 | Paper |
| Solving binary cutting stock problems by column generation and branch- and-bound | 1994-05-18 | Paper |
| Min-cut clustering | 1994-04-28 | Paper |
| The Age of Optimization: Solving Large-Scale Real-World Problems | 1994-04-12 | Paper |
| Formulating a Mixed Integer Programming Problem to Improve Solvability | 1994-03-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4694400 | 1993-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4040221 | 1993-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035632 | 1993-05-18 | Paper |
| A Characterization of Lifted-Cover Facets of Knapsack Polytope with GUB Constraints | 1993-05-18 | Paper |
| A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing | 1993-01-16 | Paper |
| A polyhedral approach to edge coloring | 1992-06-27 | Paper |
| Some Facets for an Assignment Problem with Side Constraints | 1992-06-25 | Paper |
| A recursive procedure to generate all cuts for 0-1 mixed integer programs | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3204330 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3351135 | 1990-01-01 | Paper |
| Branch-and-bound and parallel computation: A historical note | 1988-01-01 | Paper |
| Computational experience with a polynomial-time dual simplex algorithm for the transportation problem | 1986-01-01 | Paper |
| Simplex pivots on the set packing polytope | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3703584 | 1985-01-01 | Paper |
| Covering, Packing and Generalized Perfection | 1985-01-01 | Paper |
| The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs | 1984-01-01 | Paper |
| A polynomial algorithm for the max-cut problem on graphs without long odd cycles | 1984-01-01 | Paper |
| An Efficient Primal Simplex Algorithm for Maximum Weighted Vertex Packing on Bipartite Graphs | 1982-01-01 | Paper |
| R-domination of block graphs | 1982-01-01 | Paper |
| Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms | 1981-01-01 | Paper |
| An application of vertex packing to data analysis in the evaluation of pavement deterioration | 1981-01-01 | Paper |
| Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem | 1980-01-01 | Paper |
| A Canonical Representation of Simple Plant Location Problems and Its Applications | 1980-01-01 | Paper |
| Note—On “Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms” | 1979-01-01 | Paper |
| Optimal set partitioning, matchings and lagrangian duality | 1979-01-01 | Paper |
| Matroids and a Reliability Analysis Problem | 1979-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 |
| Tight bounds for christofides' traveling salesman heuristic | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4196269 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4132252 | 1977-01-01 | Paper |
| Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4101601 | 1976-01-01 | Paper |
| When the Greedy Solution Solves a Class of Knapsack Problems | 1975-01-01 | Paper |
| Vertex packings: Structural properties and algorithms | 1975-01-01 | Paper |
| Set Partitioning and Chain Decomposition | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4124603 | 1974-01-01 | Paper |
| Properties of vertex packing and independence system polyhedra | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3214706 | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5675139 | 1972-01-01 | Paper |
| A generalized permanent label setting algorithm for the shortest path between specified nodes | 1972-01-01 | Paper |
| A Modified Linear Program for Columnar Methods in Mathematical Programming | 1971-01-01 | Paper |
| Optimal Political Districting by Implicit Enumeration Techniques | 1970-01-01 | Paper |
| A finiteness proof for modified dantzig cuts in integer programming | 1970-01-01 | Paper |
| The Set-Partitioning Problem: Set Covering with Equality Constraints | 1969-01-01 | Paper |
| A decomposable transshipment algorithm for a multiperiod transportation problem | 1969-01-01 | Paper |
| Letter to the Editor—A Note on the Generalized Lagrange Multiplier Solution to an Integer Programming Problem | 1968-01-01 | Paper |
| Optimal capacity expansion | 1968-01-01 | Paper |
| The Traveling Salesman Problem: A Survey | 1968-01-01 | Paper |
| Scheduling to Minimize Interaction Cost | 1966-01-01 | Paper |
| Decomposition of linear programs by dynamic programming | 1964-01-01 | Paper |
| An Algorithm for the Line Balancing Problem | 1964-01-01 | Paper |
| A Geometric Model and a Graphical Algorithm for a Sequencing Problem | 1963-01-01 | Paper |
| On the Relation Between the Traveling-Salesman and the Longest-Path Problems | 1962-01-01 | Paper |
| Letter to the Editor—A Short Table of z-Transforms and Generating Functions | 1961-01-01 | Paper |
