| Publication | Date of Publication | Type |
|---|
| Interpretability of bi-level variable selection methods | 2024-10-28 | Paper |
| Sparse group penalties for bi-level variable selection | 2024-10-28 | Paper |
| Integer factorization: Why two-item joint replenishment is hard | 2024-07-29 | Paper |
| Switchbox routing in VLSI design: closing the complexity gap (extended abstract) | 2024-06-05 | Paper |
| Approximation Algorithms and Linear Programming Relaxations for Scheduling Problems Related to Min-Sum Set Cover | 2024-03-05 | Paper |
| 0/1-Integer programming: Optimization and Augmentation are equivalent | 2023-05-08 | Paper |
| Robust Appointment Scheduling with Heterogeneous Costs | 2023-02-03 | Paper |
| The interval order polytope of a digraph | 2022-08-30 | Paper |
| Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds | 2022-08-30 | Paper |
| Genetic Column Generation: Fast Computation of High-Dimensional Multimarginal Optimal Transport Problems | 2022-06-24 | Paper |
| Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses | 2022-05-17 | Paper |
| On the complexity of recognizing integrality and total dual integrality of the \(\{0,1/2\}\)-closure | 2022-03-11 | Paper |
| Scheduling-LPs bear probabilities. Randomized approximations for min-sum criteria | 2021-12-20 | Paper |
| On the Complexity of Recognizing Integrality and Total Dual Integrality of the $\{0,1/2\}$-Closure | 2021-04-29 | Paper |
| Genetic column generation: Fast computation of high-dimensional multi-marginal optimal transport problems | 2021-03-23 | Paper |
| Precedence-constrained scheduling and min-sum set cover (extended Abstract) | 2020-08-24 | Paper |
| Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds | 2019-01-11 | Paper |
| Transitive packing | 2019-01-11 | Paper |
| Robust monotone submodular function maximization | 2018-10-26 | Paper |
| Min-Sum Scheduling Under Precedence Constraints | 2018-03-02 | Paper |
| Scheduling jobs with communication delays: Using infeasible solutions for approximation | 2017-12-05 | Paper |
| On the Relative Complexity of 15 Problems Related to 0/1-Integer Programming | 2017-04-07 | Paper |
| Robust Appointment Scheduling | 2017-03-22 | Paper |
| Robust Monotone Submodular Function Maximization | 2016-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501313 | 2015-08-03 | Paper |
| The Gomory-Chvátal Closure of a Non-Rational Polytope is a Rational Polytope | 2015-03-03 | Paper |
| The Price of Anarchy of the Proportional Allocation Mechanism Revisited | 2015-01-12 | Paper |
| ε -optimization schemes and L-bit precision (extended abstract) | 2014-09-26 | Paper |
| The Gomory-Chvátal Closure of a Nonrational Polytope Is a Rational Polytope | 2014-07-11 | Paper |
| Approximating the least core value and least core of cooperative games with supermodular costs | 2014-04-15 | Paper |
| An FPTAS for optimizing a class of low-rank functions over a polytope | 2013-11-11 | Paper |
| A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One | 2013-07-02 | Paper |
| The complexity of welfare maximization in congestion games | 2012-06-18 | Paper |
| On the membership problem for the \({0, 1/2}\)-closure | 2012-04-05 | Paper |
| Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chvàtal rank | 2012-04-05 | Paper |
| Solving Project Scheduling Problems by Minimum Cut Computations | 2012-02-19 | Paper |
| Sharing Supermodular Costs | 2011-11-17 | Paper |
| Approximation Algorithms and Hardness Results for the Joint Replenishment Problem with Constant Demands | 2011-09-16 | Paper |
| On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games | 2011-04-27 | Paper |
| Near-Optimal Solutions and Large Integrality Gaps for Almost All Instances of Single-Machine Precedence-Constrained Scheduling | 2011-04-27 | Paper |
| Minimizing the sum of weighted completion times in a concurrent open shop | 2010-12-20 | Paper |
| On the Rank of Cutting-Plane Proof Systems | 2010-06-22 | Paper |
| Integer Programming: Optimization and Evaluation Are Equivalent | 2009-10-20 | Paper |
| Integer equal flows | 2009-08-14 | Paper |
| Fast, Fair, and Efficient Flows in Networks | 2009-08-13 | Paper |
| Approximation and Online Algorithms | 2009-08-11 | Paper |
| System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion | 2009-07-18 | Paper |
| Coordination mechanisms for selfish scheduling | 2009-04-29 | Paper |
| Encouraging Cooperation in Sharing Supermodular Costs | 2009-02-17 | Paper |
| Stochastic Online Scheduling Revisited | 2009-01-27 | Paper |
| A geometric approach to the price of anarchy in nonatomic congestion games | 2009-01-26 | Paper |
| A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One | 2008-11-27 | Paper |
| \(\varepsilon \)-optimization schemes and \(L\)-bit precision: alternative perspectives for solving combinatorial optimization problems | 2008-10-29 | Paper |
| Single-Machine Scheduling with Precedence Constraints | 2008-05-27 | Paper |
| On the Inefficiency of Equilibria in Congestion Games | 2007-08-30 | Paper |
| Efficiency and fairness of system-optimal routing with user constraints | 2007-02-02 | Paper |
| Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems | 2006-06-01 | Paper |
| Integer Programming and Combinatorial Optimization | 2005-12-23 | Paper |
| Integer Programming and Combinatorial Optimization | 2005-12-23 | Paper |
| Selfish Routing in Capacitated Networks | 2005-11-11 | Paper |
| The Complexity of Generic Primal Algorithms for Solving General Integer Programs | 2005-11-11 | Paper |
| Approximate Local Search in Combinatorial Optimization | 2005-02-21 | Paper |
| Approximation in stochastic scheduling | 2005-01-25 | Paper |
| On-line scheduling to minimize average completion time revisited. | 2005-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4818873 | 2004-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471277 | 2004-07-28 | Paper |
| On project scheduling with irregular starting time costs | 2004-01-14 | Paper |
| Bounds on the Chvatal rank of polytopes in the 0/1-cube | 2003-12-14 | Paper |
| The power of \(\alpha\)-points in preemptive single machine scheduling. | 2003-07-27 | Paper |
| Scheduling Unrelated Machines by Randomized Rounding | 2003-01-05 | Paper |
| Transitive Packing: A Unifying Concept in Combinatorial Optimization | 2003-01-05 | Paper |
| Single machine scheduling with release dates | 2002-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263708 | 2001-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2712379 | 2001-05-06 | Paper |
| On the Chvátal rank of polytopes in the 0/1 cube | 2001-03-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4494463 | 2001-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941833 | 2000-12-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938774 | 2000-02-23 | Paper |
| Base polytopes of series-parallel posets: Linear description and optimization | 1999-06-03 | Paper |
| Improved bounds on relaxations of a parallel machine scheduling problem | 1999-05-05 | Paper |
| Switchbox routing in VLSI design: Closing the complexity gap | 1999-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252434 | 1999-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3840372 | 1998-08-10 | Paper |
| Approximation algorithms | 1998-04-03 | Paper |
| Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms | 1997-10-28 | Paper |
| Facets of the generalized permutahedron of a poset | 1997-02-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4877166 | 1996-05-08 | Paper |
| The permutahedron of series-parallel posets | 1995-08-24 | Paper |
