| Publication | Date of Publication | Type |
|---|
Interpretability of bi-level variable selection methods
Biometrical Journal | 2024-10-28 | Paper |
Sparse group penalties for bi-level variable selection
Biometrical Journal | 2024-10-28 | Paper |
Integer factorization: Why two-item joint replenishment is hard
Operations Research | 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
Mathematics of Operations Research | 2024-03-05 | Paper |
0/1-Integer programming: Optimization and Augmentation are equivalent
Lecture Notes in Computer Science | 2023-05-08 | Paper |
| Robust Appointment Scheduling with Heterogeneous Costs | 2023-02-03 | Paper |
The interval order polytope of a digraph
Integer Programming and Combinatorial Optimization | 2022-08-30 | Paper |
Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds
Integer Programming and Combinatorial Optimization | 2022-08-30 | Paper |
Genetic column generation: fast computation of high-dimensional multimarginal optimal transport problems
SIAM Journal on Scientific Computing | 2022-06-24 | Paper |
Computing approximate equilibria in weighted congestion games via best-responses
Mathematics of Operations Research | 2022-05-17 | Paper |
On the complexity of recognizing integrality and total dual integrality of the \(\{0,1/2\}\)-closure
Operations Research Letters | 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
(available as arXiv preprint) | 2021-04-29 | Paper |
Genetic column generation: Fast computation of high-dimensional multi-marginal optimal transport problems
(available as arXiv preprint) | 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
Integer Programming and Combinatorial Optimization | 2019-01-11 | Paper |
Transitive packing
Integer Programming and Combinatorial Optimization | 2019-01-11 | Paper |
Robust monotone submodular function maximization
Mathematical Programming. Series A. Series B | 2018-10-26 | Paper |
Robust monotone submodular function maximization
Mathematical Programming. Series A. Series B | 2018-10-26 | Paper |
| Min-sum scheduling under precedence constraints | 2018-03-02 | Paper |
Scheduling jobs with communication delays: using infeasible solutions for approximation
Algorithms — ESA '96 | 2017-12-05 | Paper |
On the relative complexity of 15 problems related to~0/1-integer programming
Research Trends in Combinatorial Optimization | 2017-04-07 | Paper |
| Robust appointment scheduling | 2017-03-22 | Paper |
Robust monotone submodular function maximization
Integer Programming and Combinatorial Optimization | 2016-08-10 | Paper |
| Approximate local search in combinatorial optimization | 2015-08-03 | Paper |
The Gomory-Chvátal closure of a non-rational polytope is a rational polytope
Operations Research Proceedings | 2015-03-03 | Paper |
The price of anarchy of the proportional allocation mechanism revisited
Web and Internet Economics | 2015-01-12 | Paper |
\({\varepsilon}\)-optimization schemes and \(L\)-bit precision: alternative perspectives in combinatorial optimization (extended abstract)
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
The Gomory-Chvátal closure of a nonrational polytope is a rational polytope
Mathematics of Operations Research | 2014-07-11 | Paper |
Approximating the least core value and least core of cooperative games with supermodular costs
Discrete Optimization | 2014-04-15 | Paper |
An FPTAS for optimizing a class of low-rank functions over a polytope
Mathematical Programming. Series A. Series B | 2013-11-11 | Paper |
A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One
Operations Research | 2013-07-02 | Paper |
The complexity of welfare maximization in congestion games
Networks | 2012-06-18 | Paper |
On the membership problem for the \({0, 1/2}\)-closure
Operations Research Letters | 2012-04-05 | Paper |
Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chvàtal rank
Operations Research Letters | 2012-04-05 | Paper |
Solving project scheduling problems by minimum cut computations
Management Science | 2012-02-19 | Paper |
Sharing supermodular costs
Operations Research | 2011-11-17 | Paper |
Approximation algorithms and hardness results for the joint replenishment problem with constant demands
Algorithms – ESA 2011 | 2011-09-16 | Paper |
On the complexity of pure-strategy Nash equilibria in congestion and local-effect games
Mathematics of Operations Research | 2011-04-27 | Paper |
Near-optimal solutions and large integrality gaps for almost all instances of single-machine precedence-constrained scheduling
Mathematics of Operations Research | 2011-04-27 | Paper |
Minimizing the sum of weighted completion times in a concurrent open shop
Operations Research Letters | 2010-12-20 | Paper |
On the rank of cutting-plane proof systems
Integer Programming and Combinatorial Optimization | 2010-06-22 | Paper |
Integer Programming: Optimization and Evaluation Are Equivalent
Lecture Notes in Computer Science | 2009-10-20 | Paper |
Integer equal flows
Operations Research Letters | 2009-08-14 | Paper |
Fast, Fair, and Efficient Flows in Networks
Operations Research | 2009-08-13 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2009-08-11 | Paper |
System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion
Operations Research | 2009-07-18 | Paper |
Coordination mechanisms for selfish scheduling
Theoretical Computer Science | 2009-04-29 | Paper |
Encouraging Cooperation in Sharing Supermodular Costs
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-02-17 | Paper |
Stochastic Online Scheduling Revisited
Combinatorial Optimization and Applications | 2009-01-27 | Paper |
A geometric approach to the price of anarchy in nonatomic congestion games
Games and Economic Behavior | 2009-01-26 | Paper |
A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One
Lecture Notes in Computer Science | 2008-11-27 | Paper |
\(\varepsilon \)-optimization schemes and \(L\)-bit precision: alternative perspectives for solving combinatorial optimization problems
Discrete Optimization | 2008-10-29 | Paper |
Single-Machine Scheduling with Precedence Constraints
Mathematics of Operations Research | 2008-05-27 | Paper |
On the Inefficiency of Equilibria in Congestion Games
Integer Programming and Combinatorial Optimization | 2007-08-30 | Paper |
Efficiency and fairness of system-optimal routing with user constraints
Networks | 2007-02-02 | Paper |
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
SIAM Journal on Computing | 2006-06-01 | Paper |
Integer Programming and Combinatorial Optimization
Lecture Notes in Computer Science | 2005-12-23 | Paper |
Integer Programming and Combinatorial Optimization
Lecture Notes in Computer Science | 2005-12-23 | Paper |
Selfish Routing in Capacitated Networks
Mathematics of Operations Research | 2005-11-11 | Paper |
The Complexity of Generic Primal Algorithms for Solving General Integer Programs
Mathematics of Operations Research | 2005-11-11 | Paper |
Approximate Local Search in Combinatorial Optimization
SIAM Journal on Computing | 2005-02-21 | Paper |
Approximation in stochastic scheduling
Journal of the ACM | 2005-01-25 | Paper |
On-line scheduling to minimize average completion time revisited.
Operations Research Letters | 2005-01-11 | Paper |
| scientific article; zbMATH DE number 2102785 (Why is no real title available?) | 2004-09-24 | Paper |
| scientific article; zbMATH DE number 2079324 (Why is no real title available?) | 2004-07-28 | Paper |
On project scheduling with irregular starting time costs
Operations Research Letters | 2004-01-14 | Paper |
Bounds on the Chvatal rank of polytopes in the 0/1-cube
Combinatorica | 2003-12-14 | Paper |
The power of \(\alpha\)-points in preemptive single machine scheduling.
Journal of Scheduling | 2003-07-27 | Paper |
Scheduling Unrelated Machines by Randomized Rounding
SIAM Journal on Discrete Mathematics | 2003-01-05 | Paper |
Transitive Packing: A Unifying Concept in Combinatorial Optimization
SIAM Journal on Optimization | 2003-01-05 | Paper |
Single machine scheduling with release dates
SIAM Journal on Discrete Mathematics | 2002-04-23 | Paper |
| scientific article; zbMATH DE number 1342126 (Why is no real title available?) | 2001-06-26 | Paper |
| scientific article; zbMATH DE number 1594568 (Why is no real title available?) | 2001-05-06 | Paper |
On the Chvátal rank of polytopes in the 0/1 cube
Discrete Applied Mathematics | 2001-03-04 | Paper |
| scientific article; zbMATH DE number 1487924 (Why is no real title available?) | 2001-02-09 | Paper |
| scientific article; zbMATH DE number 1418273 (Why is no real title available?) | 2000-12-05 | Paper |
| scientific article; zbMATH DE number 1405789 (Why is no real title available?) | 2000-02-23 | Paper |
Base polytopes of series-parallel posets: Linear description and optimization
Mathematical Programming. Series A. Series B | 1999-06-03 | Paper |
Improved bounds on relaxations of a parallel machine scheduling problem
Journal of Combinatorial Optimization | 1999-05-05 | Paper |
Switchbox routing in VLSI design: Closing the complexity gap
Theoretical Computer Science | 1999-01-12 | Paper |
| scientific article; zbMATH DE number 1305542 (Why is no real title available?) | 1999-01-01 | Paper |
| scientific article; zbMATH DE number 1187165 (Why is no real title available?) | 1998-08-10 | Paper |
Approximation algorithms
Proceedings of the National Academy of Sciences | 1998-04-03 | Paper |
Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
Mathematics of Operations Research | 1997-10-28 | Paper |
Facets of the generalized permutahedron of a poset
Discrete Applied Mathematics | 1997-02-25 | Paper |
| scientific article; zbMATH DE number 876684 (Why is no real title available?) | 1996-05-08 | Paper |
The permutahedron of series-parallel posets
Discrete Applied Mathematics | 1995-08-24 | Paper |
