| Publication | Date of Publication | Type |
|---|
| A heuristic algorithm for the set covering problem | 2019-01-11 | Paper |
| Generation of Antipodal Random Vectors With Prescribed Non-Stationary 2-nd Order Statistics | 2018-08-22 | Paper |
| Variability-Aware Task Allocation for Energy-Efficient Quality of Service Provisioning in Embedded Streaming Multimedia Applications | 2017-07-12 | Paper |
| A new lower bound for curriculum-based course timetabling | 2016-11-10 | Paper |
| Bilevel Knapsack with Interdiction Constraints | 2016-08-12 | Paper |
| Improving a family of approximation algorithms to edge color multigraphs | 2016-06-09 | Paper |
| Theoretical and computational results about optimality-based domain reductions | 2016-05-25 | Paper |
| Solving the temporal knapsack problem via recursive Dantzig-Wolfe reformulation | 2016-03-01 | Paper |
| Friendly bin packing instances without integer round-up property | 2015-04-16 | Paper |
| Automatic Dantzig-Wolfe reformulation of mixed integer programs | 2015-02-09 | Paper |
| A Study on the Computational Complexity of the Bilevel Knapsack Problem | 2014-09-26 | Paper |
| Delay-Robust Event Scheduling | 2014-08-11 | Paper |
| A Lagrangian heuristic for a train-unit assignment problem | 2014-04-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2861498 | 2013-11-08 | Paper |
| On integer polytopes with few nonzero vertices | 2013-06-24 | Paper |
| A Complexity and Approximability Study of the Bilevel Knapsack Problem | 2013-03-19 | Paper |
| Finding cliques of maximum weight on a generalization of permutation graphs | 2013-03-07 | Paper |
| Optimal linear arrangements using betweenness variables | 2012-11-27 | Paper |
| Models and Algorithms for the Train Unit Assignment Problem | 2012-11-02 | Paper |
| An effective branch-and-bound algorithm for convex quadratic integer programming | 2012-10-15 | Paper |
| Almost 20 Years of Combinatorial Optimization for Railway Planning: from Lagrangian Relaxation to Column Generation | 2012-09-28 | Paper |
| Robust train routing and online re-scheduling | 2012-09-28 | Paper |
| Recoverable Robustness for Railway Rolling Stock Planning | 2012-09-28 | Paper |
| 04. Solution of the Train Platforming Problem | 2012-09-28 | Paper |
| Solving a Real-World Train Unit Assignment Problem | 2012-09-28 | Paper |
| Decorous Lower Bounds for Minimum Linear Arrangement | 2012-07-28 | Paper |
| An approximation scheme for the two-stage, two-dimensional knapsack problem | 2012-06-20 | Paper |
| Embedding {0, ½}-Cuts in a Branch-and-Cut Framework: A Computational Study | 2012-06-18 | Paper |
| Laying Out Sparse Graphs with Provably Minimum Bandwidth | 2012-06-08 | Paper |
| Sorting Permutations by Reversals Through Branch-and-Price | 2012-05-30 | Paper |
| The Reversal Median Problem | 2012-05-30 | Paper |
| Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation | 2011-06-24 | Paper |
| Global optimization problems and domain reduction strategies | 2010-10-13 | Paper |
| New techniques for cost sharing in combinatorial optimization games | 2010-09-16 | Paper |
| Solving a real-world train-unit assignment problem | 2010-09-16 | Paper |
| A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing | 2010-09-06 | Paper |
| An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming | 2010-06-22 | Paper |
| Non-cyclic train timetabling and comparability graphs | 2010-06-08 | Paper |
| Modified subset sum heuristics for bin packing | 2009-12-18 | Paper |
| A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability | 2009-12-17 | Paper |
| Modeling and Solving the Train Timetabling Problem | 2009-07-03 | Paper |
| Bidimensional packing by bilinear programming | 2009-05-04 | Paper |
| A column generation approach to train timetabling on a corridor | 2008-09-04 | Paper |
| A New Lower Bound for the Minimum Linear Arrangement of a Graph | 2008-06-05 | Paper |
| Packing d-Dimensional Bins in d Stages | 2008-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5457089 | 2008-04-14 | Paper |
| Constrained 0-1 quadratic programming: basic approaches and extensions | 2008-01-21 | Paper |
| Bidimensional Packing by Bilinear Programming | 2007-08-30 | Paper |
| Packing into the smallest square: worst-case analysis of lower bounds | 2007-02-20 | Paper |
| A Lagrangian heuristic algorithm for a real-world train timetabling problem | 2006-04-28 | Paper |
| A branch-and-cut algorithm for multiple sequence alignment | 2006-01-13 | Paper |
| Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing | 2005-11-11 | Paper |
| Ond-threshold graphs andd-dimensional bin packing | 2005-01-12 | Paper |
| Packing cuts in undirected graphs | 2004-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737536 | 2004-08-11 | Paper |
| On the two-dimensional knapsack problem | 2004-07-01 | Paper |
| Approximation schemes for ordered vector packing problems | 2004-03-15 | Paper |
| Packing cycles in undirected graphs | 2004-03-14 | Paper |
| Models and algorithms for a staff scheduling problem | 2004-03-11 | Paper |
| Worst-case analysis of the subset sum algorithm for bin packing. | 2004-01-05 | Paper |
| On the separation of split cuts and related inequalities | 2003-10-29 | Paper |
| A 3/4-approximation algorithm for multiple subset sum | 2003-08-28 | Paper |
| On the Practical Solution of the Reversal Median Problem | 2003-04-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796199 | 2003-03-02 | Paper |
| On the stability number of the edge intersection of two graphs. | 2003-01-21 | Paper |
| Packing triangles in bounded degree graphs. | 2003-01-21 | Paper |
| Additive Bounding, Worst-Case Analysis, and the Breakpoint Median Problem | 2003-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4780784 | 2002-11-21 | Paper |
| Lower bounds and algorithms for the 2-dimensional vector packing problem | 2002-11-04 | Paper |
| A PTAS for the multiple subset sum problem with different knapsack capacities | 2002-07-25 | Paper |
| Modeling and Solving the Crew Rostering Problem | 2002-07-01 | Paper |
| Improved approximation for breakpoint graph decomposition and sorting by reversals | 2002-05-28 | Paper |
| On bandwidth-2 graphs | 2002-05-15 | Paper |
| A Heuristic Method for the Set Covering Problem | 2002-01-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4246787 | 2002-01-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2759903 | 2001-12-18 | Paper |
| Separating lifted odd-hole inequalities to solve the index selection problem | 2001-09-03 | Paper |
| Algorithms for the set covering problem | 2001-06-14 | Paper |
| On the separation of maximally violated mod-\(k\) cuts | 2001-05-02 | Paper |
| The Multiple Subset Sum Problem | 2001-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263704 | 2001-03-04 | Paper |
| Approximation algorithms for knapsack problems with cardinality constraints | 2000-07-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952593 | 2000-05-10 | Paper |
| On the tightness of the alternating-cycle lower bound for sorting by reversals | 1999-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4699368 | 1999-11-10 | Paper |
| Sorting Permutations by Reversals and Eulerian Cycle Decompositions | 1999-06-27 | Paper |
| Properties of some ILP formulations of a class of partitioning problems | 1999-04-19 | Paper |
| Exact Solution of the Quadratic Knapsack Problem | 1999-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4398361 | 1998-07-19 | Paper |
| Algorithms for railway crew management | 1997-08-28 | Paper |
| \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts | 1996-11-24 | Paper |
| A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem | 1996-10-31 | Paper |
