| Publication | Date of Publication | Type |
|---|
| Comments on “An Exact Method for the Minimum Feedback Arc Set Problem” | 2024-04-14 | Paper |
| Quantum Annealing versus Digital Computing | 2022-09-06 | Paper |
| Exact and heuristic methods in combinatorial optimization. A study on the linear ordering and the maximum diversity problem | 2022-04-06 | Paper |
| Solving the Earth Observing Satellite Constellation Scheduling Problem by Branch-and-Price | 2019-09-13 | Paper |
| A mixed integer linear programming model for multi-satellite scheduling | 2019-01-28 | Paper |
| A polyhedral approach to the feedback vertex set problem | 2019-01-11 | Paper |
| A First Derivative Potts Model for Segmentation and Denoising Using ILP | 2018-10-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5271455 | 2017-07-11 | Paper |
| The LP-Newton Method and Conic Optimization | 2016-11-28 | Paper |
| PANDA: a software for polyhedral transformations | 2016-01-14 | Paper |
| The Lagrangian relaxation for the combinatorial integral approximation problem | 2015-09-04 | Paper |
| A branch and cut solver for the maximum stable set problem | 2015-08-24 | Paper |
| Evaluating the quality of image matrices in blockmodeling | 2015-07-31 | Paper |
| Martin Grötschel—The Early Years in Bonn and Augsburg | 2015-07-22 | Paper |
| On a binary distance model for the minimum linear arrangement problem | 2014-10-08 | Paper |
| A branch-and-bound algorithm for the coupled task problem | 2014-09-08 | Paper |
| Lifting and separation procedures for the cut polytope | 2014-08-29 | Paper |
| On-line bin packing with restricted repacking | 2014-02-25 | Paper |
| Generating partitions of a graph into a fixed number of minimum weight cuts | 2013-05-31 | Paper |
| A tutorial on branch and cut algorithms for the maximum stable set problem | 2013-04-24 | Paper |
| Exact ground states of two-dimensional \(\pm J\) Ising spin glasses | 2013-04-10 | Paper |
| Exact solution of the 2-dimensional grid arrangement problem | 2012-12-28 | Paper |
| Optimal linear arrangements using betweenness variables | 2012-11-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2909025 | 2012-08-29 | Paper |
| A benchmark library and a comparison of heuristic methods for the linear ordering problem | 2012-06-19 | Paper |
| Maximally Violated Mod-p Cuts for the Capacitated Vehicle-Routing Problem | 2012-06-18 | Paper |
| A Heuristic for an Earth Observing Satellite Constellation Scheduling Problem with Download Considerations | 2012-05-13 | Paper |
| New results on the windy postman problem | 2012-04-27 | Paper |
| Optimizing in Graphs with Expensive Computation of Edge Weights | 2011-04-07 | Paper |
| Parallel Computation for the Bandwidth Minimization Problem | 2011-04-07 | Paper |
| Heuristics for Budget Facility Location-Network Design Problems with Minisum Objective | 2011-04-07 | Paper |
| The linear ordering problem. Exact and heuristic methods in combinatorial optimization. | 2010-12-16 | Paper |
| On a class of metrics related to graph layout problems | 2010-11-05 | Paper |
| Traces of the XII Aussois Workshop on combinatorial optimization | 2010-09-16 | Paper |
| Odd Minimum Cut Sets and b-Matchings Revisited | 2009-11-27 | Paper |
| Applying mod-\(k\)-cuts for solving linear ordering problems | 2009-09-03 | Paper |
| BoxStep methods for crew pairing problems | 2009-08-12 | Paper |
| The simultaneous consecutive ones problem | 2009-05-28 | Paper |
| Improved analysis of an algorithm for the coupled task problem with UET jobs | 2009-05-07 | Paper |
| Direct methods with maximal lower bound for mixed-integer optimal control problems | 2009-05-04 | Paper |
| Lower Bound for the Online Bin Packing Problem with Restricted Repacking | 2009-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3504738 | 2008-06-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5384876 | 2008-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5454135 | 2008-04-03 | Paper |
| On the general routing polytope | 2008-02-26 | Paper |
| Computing finest mincut partitions of a graph and application to routing problems | 2008-02-26 | Paper |
| Not Every GTSP Facet Induces an STSP Facet | 2007-08-30 | Paper |
| Computing Best Transition Pathways in High-Dimensional Dynamical Systems: Application to the AlphaL \leftrightharpoons Beta \leftrightharpoons AlphaR Transitions in Octaalanine | 2007-06-26 | Paper |
| On the graphical relaxation of the symmetric traveling salesman polytope | 2007-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3416579 | 2007-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5395222 | 2006-11-02 | Paper |
| Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm | 2006-08-23 | Paper |
| A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem | 2006-06-30 | Paper |
| A note on the undirected rural postman problem polytope | 2006-06-14 | Paper |
| Integer Programming and Combinatorial Optimization | 2005-12-23 | Paper |
| Transformation of Facets of the General Routing Problem Polytope | 2005-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5465115 | 2005-08-22 | Paper |
| DECOMPOSITION AND PARALLELIZATION TECHNIQUES FOR ENUMERATING THE FACETS OF COMBINATORIAL POLYTOPES | 2005-06-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4667088 | 2005-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4667108 | 2005-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4668573 | 2005-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4666721 | 2005-04-05 | Paper |
| An exact algorithm for scheduling identical coupled tasks | 2005-02-11 | Paper |
| A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints | 2003-08-26 | Paper |
| The weighted consecutive ones problem for a fixed number of rows or columns. | 2003-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414644 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411346 | 2003-07-08 | Paper |
| Algorithmic aspects of using small instance relaxations in parallel branch-and-cut | 2001-08-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2712305 | 2001-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766846 | 2000-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3840361 | 1998-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4398370 | 1998-07-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4353133 | 1997-12-11 | Paper |
| Combinatorial optimization and small polytopes | 1997-03-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4840772 | 1996-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4845366 | 1996-03-05 | Paper |
| Provably good solutions for the traveling salesman problem | 1995-06-25 | Paper |
| Quadratic \(0/1\) optimization and a decomposition approach for the placement of electronic circuits | 1994-12-01 | Paper |
| The traveling salesman. Computational solutions for RSP applications | 1994-12-01 | Paper |
| A note on small linear-ordering polytopes | 1993-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4694565 | 1993-08-22 | Paper |
| Fast Heuristics for Large Geometric Traveling Salesman Problems | 1993-04-01 | Paper |
| TSPLIB—A Traveling Salesman Problem Library | 1993-02-11 | Paper |
| A complete description of the traveling salesman polytope on 8 nodes | 1992-06-28 | Paper |
| Computing correct Delaunay triangulations | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3974960 | 1992-06-26 | Paper |
| Optimal control of plotting and drilling machines: A case study | 1991-01-01 | Paper |
| Experiments in quadratic 0-1 programming | 1989-01-01 | Paper |
| Via Minimization with Pin Preassignments and Layer Preference | 1989-01-01 | Paper |
| An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design | 1988-01-01 | Paper |
| Generalizations of Cliques, Odd Cycles and Anticycles and Their Relation to Independence System Polyhedra | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3680289 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3680606 | 1985-01-01 | Paper |
| On the acyclic subgraph polytope | 1985-01-01 | Paper |
| Facets of the linear ordering polytope | 1985-01-01 | Paper |
| On partitioning the edges of graphs into connected subgraphs | 1985-01-01 | Paper |
| A Cutting Plane Algorithm for the Linear Ordering Problem | 1984-01-01 | Paper |
