| Publication | Date of Publication | Type |
|---|
| Cost‐raising internalization in supply chain design | 2023-10-17 | Paper |
| Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts | 2022-10-14 | Paper |
| Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds | 2022-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633897 | 2019-05-06 | Paper |
| Efficiency of equilibria in restricted uniform machine scheduling with total weighted completion time as social cost | 2019-03-05 | Paper |
| Combinatorial approach to inference in partially identified incomplete structural models | 2018-09-12 | Paper |
| Optimum turn-restricted paths, nested compatibility, and optimum convex polygons | 2018-07-26 | Paper |
| Largest minimal inversion-complete and pair-complete sets of permutations | 2018-04-27 | Paper |
| A study of the Bienstock-Zuckerberg algorithm: applications in mining and resource constrained project scheduling | 2018-04-20 | Paper |
| Tight MIP formulations for bounded up/down times and interval-dependent start-ups | 2017-07-21 | Paper |
| Carathéodory, Helly, and Radon Numbers for Sublattice and Related Convexities | 2017-06-02 | Paper |
| Optimal pits and optimal transportation | 2016-01-07 | Paper |
| Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs | 2015-12-09 | Paper |
| A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts | 2014-06-02 | Paper |
| Integer preemptive scheduling on parallel machines | 2013-03-05 | Paper |
| Technical Note—A Sampling-Based Approach to Appointment Scheduling | 2012-11-08 | Paper |
| Structural and algorithmic properties for parametric minimum cuts | 2012-10-15 | Paper |
| Rational generating functions and integer programming games | 2012-06-26 | Paper |
| The interval ordering problem | 2012-05-30 | Paper |
| Appointment scheduling with discrete random durations | 2012-05-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115718 | 2012-02-10 | Paper |
| Toward Robust Revenue Management: Competitive Analysis of Online Booking | 2011-11-24 | Paper |
| Clique partitioning of interval graphs with submodular costs on the cliques | 2011-06-01 | Paper |
| Properties of optimal schedules in preemptive shop scheduling | 2011-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3061959 | 2011-01-03 | Paper |
| Minimizing the sum of weighted completion times in a concurrent open shop | 2010-12-20 | Paper |
| Parametric integer programming algorithm for bilevel mixed integer programs | 2010-10-27 | Paper |
| Separation, dimension, and facet algorithms for node flow polyhedra | 2010-09-16 | Paper |
| Minimizing the number of machines for minimum length schedules | 2009-12-07 | Paper |
| Integrality Property in Preemptive Parallel Machine Scheduling | 2009-08-18 | Paper |
| Dynamic Multipriority Patient Scheduling for a Diagnostic Resource | 2009-08-13 | Paper |
| On the Asymptotic Optimality of a Simple On-Line Algorithm for the Stochastic Single-Machine Weighted Completion Time Problem and Its Extensions | 2009-08-13 | Paper |
| Decompositions, Network Flows, and a Precedence Constrained Single-Machine Scheduling Problem | 2009-07-09 | Paper |
| Production and Inventory Model Using Net Present Value | 2009-07-03 | Paper |
| Batch processing with interval graph compatibilities between tasks | 2008-03-18 | Paper |
| Sublattices of product spaces: Hulls, representations and counting | 2008-03-13 | Paper |
| Approximation algorithms for shop scheduling problems with minsum objective: A correction | 2007-05-15 | Paper |
| Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems | 2006-06-01 | Paper |
| The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates | 2006-05-02 | Paper |
| Bimonotone linear inequalities and sublattices of \(\mathbb R^n\) | 2006-03-16 | Paper |
| On the asymptotic optimality of algorithms for the flow shop problem with release dates | 2005-06-01 | Paper |
| Minimizing a Convex Cost Closure Set | 2004-01-08 | Paper |
| A (2+ε)-approximation algorithm for the generalized preemptive open shop problem with minsum objective | 2003-05-14 | Paper |
| Approximation algorithms for shop scheduling problems with minsum objective | 2002-08-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4537755 | 2002-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4537734 | 2002-06-20 | Paper |
| Single machine scheduling with release dates | 2002-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753941 | 2001-12-18 | Paper |
| A general class of greedily solvable linear programs | 2001-11-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952712 | 2001-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263714 | 2000-11-27 | Paper |
| Minimizing symmetric submodular functions | 1999-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234156 | 1999-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3840372 | 1998-08-10 | Paper |
| Approximation algorithms for multi-index transportation problems with decomposable costs | 1998-03-04 | Paper |
| Single Resource Multi-Item Inventory Systems | 1997-07-06 | Paper |
| On the Two-Level Uncapacitated Facility Location Problem | 1997-06-10 | Paper |
| An Exact Algorithm for Maximum Entropy Sampling | 1997-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4887740 | 1996-08-05 | Paper |
| A feedback strategy for periodic network flows | 1996-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886038 | 1996-07-28 | Paper |
| Symmetric Inequalities and Their Composition for Asymmetric Travelling Salesman Polytopes | 1996-06-09 | Paper |
| Ladders for Travelling Salesmen | 1996-04-01 | Paper |
| Symmetric Inequalities and Their Composition for Asymmetric Travelling Salesman Polytopes | 1996-02-25 | Paper |
| The performance ratio of grouping policies for the joint replenishment problem | 1994-01-02 | Paper |
| Structure of a simple scheduling polyhedron | 1993-06-29 | Paper |
| Hamiltonian path and symmetric travelling salesman polytopes | 1993-06-29 | Paper |
| Simple Power-of-Two Policies are Close to Optimal in a General Class of Production/Distribution Networks with General Joint Setup Costs | 1993-03-01 | Paper |
| On the convex hull of feasible solutions to certain combinatorial problems | 1993-01-16 | Paper |
| Lot Sizing Policies for Finite Production Rate Assembly Systems | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3987787 | 1992-06-28 | Paper |
| Single-Machine Scheduling Polyhedra with Precedence Constraints | 1992-06-25 | Paper |
| Cut-threshold graphs | 1991-01-01 | Paper |
| Comment on “A Dynamic Programming Algorithm for Joint Replenishment Under General Order Cost Functions” | 1987-01-01 | Paper |
| Performance ratio of polynomial heuristics for triangle inequality quadratic assignment problems | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3758553 | 1986-01-01 | Paper |
| Bounds for Assembly Line Balancing Heuristics | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3683848 | 1984-01-01 | Paper |
| On finding the K best cuts in a network | 1984-01-01 | Paper |
| On Dynamic Programming Methods for Assembly Line Balancing | 1982-01-01 | Paper |
| Selected Applications of Minimum Cuts in Networks | 1982-01-01 | Paper |
| A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory | 1982-01-01 | Paper |
| On the One-Dimensional Space Allocation Problem | 1981-01-01 | Paper |
| The travelling salesman problem as a constrained shortest path problem: Theory and computational experience | 1980-01-01 | Paper |
| On the structure of all minimum cuts in a network and applications | 1980-01-01 | Paper |
| Theoretical Efficiency of the Algorithm “Capacity” for the Maximum Flow Problem | 1980-01-01 | Paper |
| The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling | 1978-01-01 | Paper |
| On the integer-valued variables in the linear vertex packing problem | 1977-01-01 | Paper |
