| Publication | Date of Publication | Type |
|---|
| An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem | 2022-11-24 | Paper |
| Safe distancing in the time of COVID-19 | 2022-09-09 | Paper |
| Interdiction Games and Monotonicity, with Application to Knapsack Problems | 2020-12-03 | Paper |
| A branch-and-cut algorithm for mixed-integer bilinear programming | 2020-01-08 | Paper |
| Finding First and Most-Beautiful Queens by Integer Programming | 2019-07-18 | Paper |
| A heuristic algorithm for the set covering problem | 2019-01-11 | Paper |
| Chasing first queens by integer programming | 2018-11-21 | Paper |
| Deep neural networks and mixed integer linear optimization | 2018-11-08 | Paper |
| On the use of intersection cuts for bilevel optimization | 2018-10-26 | Paper |
| Orbital shrinking: theory and applications | 2018-09-25 | Paper |
| Least cost influence propagation in (social) networks | 2018-07-13 | Paper |
| SelfSplit parallelization for mixed-integer linear programming | 2018-07-11 | Paper |
| A dynamic reformulation heuristic for generalized interdiction problems | 2018-05-30 | Paper |
| Mixed-integer linear programming heuristics for the prepack optimization problem | 2018-05-24 | Paper |
| Fast training of support vector machines with Gaussian kernel | 2018-05-24 | Paper |
| Thinning out Steiner trees: a node-based model for uniform edge costs | 2018-02-23 | Paper |
| Using a general-purpose mixed-integer linear programming solver for the practical solution of real-time train rescheduling | 2018-02-06 | Paper |
| A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs | 2018-01-11 | Paper |
| Comments on: ``On learning and branching: a survey | 2017-10-12 | Paper |
| Proximity search for 0--1 mixed-integer convex programming | 2017-04-26 | Paper |
| On handling indicator constraints in mixed integer programming | 2016-12-15 | Paper |
| Benders decomposition without separability: a computational study for capacitated facility location problems | 2016-10-07 | Paper |
| Intersection Cuts for Bilevel Optimization | 2016-08-10 | Paper |
| Improving branch-and-cut performance by random sampling | 2016-04-13 | Paper |
| Boosting the feasibility pump | 2015-09-16 | Paper |
| MIP‐and‐refine matheuristic for smart grid energy management | 2015-04-22 | Paper |
| Exploiting Erraticism in Search | 2014-06-26 | Paper |
| On the knapsack closure of 0-1 integer linear programs | 2013-11-08 | Paper |
| Cutting plane versus compact formulations for uncertain (integer) linear programs | 2013-08-05 | Paper |
| Three Ideas for the Quadratic Assignment Problem | 2012-12-07 | Paper |
| A relax-and-cut framework for Gomory mixed-integer cuts | 2012-11-27 | Paper |
| Orbital Shrinking | 2012-11-02 | Paper |
| A hard integer program made easy by lexicography | 2012-10-15 | Paper |
| Fast approaches to robust railway timetabling | 2012-09-28 | Paper |
| Branching on nonchimerical fractionalities | 2012-08-17 | Paper |
| Pruning moves | 2012-07-28 | Paper |
| Embedding \(\{0, \frac{1}{2}\}\)-cuts in a branch-and-cut framework: a computational study | 2012-06-18 | Paper |
| Solving the Cell Suppression Problem on Tabular Data with Linear Constraints | 2012-02-19 | Paper |
| A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems | 2012-02-19 | Paper |
| Lexicography and degeneracy: Can a pure cutting plane algorithm work? | 2011-11-23 | Paper |
| Backdoor branching | 2011-06-24 | Paper |
| On the separation of disjunctive cuts | 2011-06-17 | Paper |
| On the enumerative nature of Gomory's dual cutting plane method | 2010-11-22 | Paper |
| A note on the selection of Benders' cuts | 2010-09-16 | Paper |
| An in-out approach to disjunctive optimization | 2010-06-22 | Paper |
| A relax-and-cut framework for Gomory's mixed-integer cuts | 2010-06-22 | Paper |
| Feasibility pump 2.0 | 2009-12-09 | Paper |
| Light robustness | 2009-12-03 | Paper |
| Combinatorial Benders' Cuts for Mixed-Integer Linear Programming | 2009-08-13 | Paper |
| Mixed-integer programming models for nesting problems | 2009-08-06 | Paper |
| Modeling and Solving the Train Timetabling Problem | 2009-07-03 | Paper |
| How tight is the corner relaxation? | 2008-10-29 | Paper |
| Can Pure Cutting Plane Algorithms Work? | 2008-06-10 | Paper |
| The linear ordering problem with cumulative costs | 2008-04-24 | Paper |
| Projected Chvátal-Gomory cuts for mixed integer linear programs | 2008-03-12 | Paper |
| A feasibility pump heuristic for general mixed-integer problems | 2008-02-22 | Paper |
| Repairing MIP infeasibility through local branching | 2007-11-06 | Paper |
| Mixed-Integer Cuts from Cyclic Groups | 2007-08-30 | Paper |
| Optimizing over the First Chvàtal Closure | 2007-08-30 | Paper |
| MIPping closures: An instant survey | 2007-07-19 | Paper |
| Optimizing over the first Chvátal closure | 2007-04-19 | Paper |
| Mixed-integer cuts from cyclic groups | 2007-03-05 | Paper |
| New facets of the STS polytope generated from known facets of the ATS polytope | 2006-06-30 | Paper |
| A new ILP-based refinement heuristic for vehicle routing problems | 2006-01-13 | Paper |
| An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem | 2006-01-13 | Paper |
| Integer Programming and Combinatorial Optimization | 2005-12-23 | Paper |
| The feasibility pump | 2005-10-31 | Paper |
| A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem | 2005-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4461915 | 2004-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4461906 | 2004-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4461905 | 2004-05-18 | Paper |
| Local branching | 2004-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414638 | 2003-07-25 | Paper |
| Optimisation of the interconnecting network of a UMTS radio mobile telephone system | 2003-04-28 | Paper |
| Exact algorithms for minimum routing cost trees | 2002-07-01 | Paper |
| Modeling and solving the crew rostering problem | 2002-07-01 | Paper |
| A Heuristic Method for the Set Covering Problem | 2002-01-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2759914 | 2001-12-18 | Paper |
| Lifted cycle inequalities for the asymmetric traveling salesman problem | 2001-11-26 | Paper |
| A polyhedral study of the asymmetric traveling salesman problem with time windows | 2001-11-16 | Paper |
| Algorithms for the set covering problem | 2001-06-14 | Paper |
| On the separation of maximally violated mod-\(k\) cuts | 2001-05-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263704 | 2001-03-04 | Paper |
| Solving the asymmetric travelling salesman problem with time windows by branch-and-cut | 2001-01-01 | Paper |
| Frequency assignment in mobile radio systems using branch-and-cut techniques | 2000-09-20 | Paper |
| Models and algorithms for the 2-dimensional cell suppression problem in statistical disclosure control | 2000-07-21 | Paper |
| A polyhedral approach to an integer multicommodity flow problem | 2000-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4699368 | 1999-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234130 | 1999-03-16 | Paper |
| A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem | 1998-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4398361 | 1998-07-19 | Paper |
| A Polyhedral Approach to the Asymmetric Traveling Salesman Problem | 1998-06-08 | Paper |
| Solving the Orienteering Problem through Branch-and-Cut | 1998-01-01 | Paper |
| On the monotonization of polyhedra | 1997-11-25 | Paper |
| Algorithms for railway crew management | 1997-08-28 | Paper |
| A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem | 1997-07-23 | Paper |
| \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts | 1996-11-24 | Paper |
| The symmetric generalized traveling salesman polytope | 1996-11-13 | Paper |
| The precedence-constrained asymmetric traveling salesman polytope | 1995-05-28 | Paper |
| Clique tree inequalities define facets of the asymmetric traveling salesman polytope | 1995-02-01 | Paper |
| A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs | 1995-01-12 | Paper |
| The Delivery Man Problem and Cumulative Matroids | 1994-07-13 | Paper |
| Weighted k‐cardinality trees: Complexity and polyhedral structure | 1994-05-09 | Paper |
| An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs | 1994-03-24 | Paper |
| Heuristic Algorithms for the Multiple Depot Vehicle Scheduling Problem | 1993-09-15 | Paper |
| A lifting procedure for asymmetric traveling salesman polytope and a large new class of facets | 1993-08-17 | Paper |
| The Fixed-Outdegree 1-Arborescence Polytope | 1993-03-01 | Paper |
| Approximation Algorithms for Fixed Job Schedule Problems | 1992-06-28 | Paper |
| An additive bounding procedure for the asymmetric travelling salesman problem | 1992-06-28 | Paper |
| Facets of two Steiner arborescence polyhedra | 1992-06-27 | Paper |
| Facets of the Asymmetric Traveling Salesman Polytope | 1992-06-25 | Paper |
| A new linear storage, polynomial-time approximation scheme for the subset-sum problem | 1990-01-01 | Paper |
| A branch and bound algorithm for the multiple depot vehicle scheduling problem | 1989-01-01 | Paper |
| The Fixed Job Schedule Problem with Working-Time Constraints | 1989-01-01 | Paper |
| An Additive Bounding Procedure for Combinatorial Optimization Problems | 1989-01-01 | Paper |
| New lower bounds for the symmetric travelling salesman problem | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4205235 | 1988-01-01 | Paper |
| A new dominance procedure for combinatorial optimization problems | 1988-01-01 | Paper |
| The Fixed Job Schedule Problem with Spread-Time Constraints | 1987-01-01 | Paper |
| Worst-case analysis of the differencing method for the partition problem | 1987-01-01 | Paper |
| Worst-case analysis of an approximation scheme for the subset-sum problem | 1986-01-01 | Paper |
