| Publication | Date of Publication | Type |
|---|
| Stochastic optimization is (almost) as easy as deterministic optimization | 2026-05-29 | Paper |
Network flow problems with electric vehicles
Mathematical Programming. Series A. Series B | 2026-05-08 | Paper |
| Reducing income variability in natural resource portfolios via integer programming | 2025-11-19 | Paper |
| Small additive error for unsplittable multicommodity flow in outerplanar graphs | 2025-06-06 | Paper |
| Bounding the price-of-fair-sharing using knapsack-cover constraints to guide near-optimal cost-recovery algorithms | 2025-06-06 | Paper |
| Network flow problems with electric vehicles | 2025-02-07 | Paper |
| Improved approximation algorithms for the joint replenishment problem with outliers, and with fairness constraints | 2024-11-28 | Paper |
| Hitting sets when the shallow cell complexity is small | 2024-07-19 | Paper |
From Switch Scheduling to Datacenter Scheduling
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Erratum to “Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems”
Mathematics of Operations Research | 2024-03-01 | Paper |
Scheduling appointments online: the power of deferred decision-making
Approximation and Online Algorithms | 2023-07-25 | Paper |
A min-max theorem for the minimum fleet-size problem
Operations Research Letters | 2023-07-03 | Paper |
SPT optimality (mostly) via linear programming
Operations Research Letters | 2023-06-27 | Paper |
Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems
Operations Research | 2022-12-01 | Paper |
Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem
ACM Transactions on Algorithms | 2022-02-22 | Paper |
On the power of static assignment policies for robust facility location problems
(available as arXiv preprint) | 2021-12-21 | Paper |
Data-driven rebalancing methods for bike-share systems
Analytics for the Sharing Economy: Mathematics, Engineering and Business Perspectives | 2021-10-05 | Paper |
Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems
Mathematics of Operations Research | 2020-09-01 | Paper |
| Prize-collecting TSP with a budget constraint | 2020-05-27 | Paper |
Aggregating courier deliveries
Naval Research Logistics | 2018-11-06 | Paper |
Fault-tolerant facility location
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Improving Christofides' algorithm for the \(s\)-\(t\) path TSP
Journal of the ACM | 2018-08-02 | Paper |
| A bicriteria approximation algorithm for the \(k\)-center and \(k\)-median problems | 2018-06-22 | Paper |
Minimizing multimodular functions and allocating capacity in bike-sharing systems
(available as arXiv preprint) | 2017-08-31 | Paper |
A primal-dual approximation algorithm for Min-sum single-machine scheduling problems
SIAM Journal on Discrete Mathematics | 2017-05-24 | Paper |
In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation
Notices of the American Mathematical Society | 2016-12-29 | Paper |
A constant-factor approximation algorithm for the \(k\)-median problem (extended abstract)
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
The submodular joint replenishment problem
Mathematical Programming. Series A. Series B | 2016-08-25 | Paper |
An approximation scheme for stochastic linear programming and its application to stochastic integer programs
Journal of the ACM | 2015-12-04 | Paper |
Primal-dual schema for capacitated covering problems
Mathematical Programming. Series A. Series B | 2015-10-19 | Paper |
| scientific article; zbMATH DE number 6472635 (Why is no real title available?) | 2015-08-14 | Paper |
| Facility location with service installation costs | 2015-08-03 | Paper |
Approximation algorithms for fragmenting a graph against a stochastically-located threat
Theory of Computing Systems | 2015-05-12 | Paper |
Provably near-optimal sampling-based algorithms for stochastic inventory control models
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
| A constant approximation algorithm for the one-warehouse multi-retailer problem | 2014-10-13 | Paper |
Improving Christofides' algorithm for the \(s\)-\(t\) path TSP
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Sampling-based approximation algorithms for multistage stochastic optimization
SIAM Journal on Computing | 2012-11-29 | Paper |
Approximation algorithms for fragmenting a graph against a stochastically-located threat
Approximation and Online Algorithms | 2012-07-16 | Paper |
A constant approximation algorithm for the one-warehouse multiretailer problem
Management Science | 2012-02-29 | Paper |
LP-based approximation algorithms for capacitated facility location
Mathematical Programming. Series A. Series B | 2012-02-22 | Paper |
Approximation algorithms for supply chain planning and logistics problems with market choice
Mathematical Programming. Series A. Series B | 2011-11-23 | Paper |
Dynamic assortment optimization with a multinomial logit choice model and capacity constraint
Operations Research | 2011-11-17 | Paper |
Primal-dual schema and Lagrangian relaxation for the k-location-routing problem
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2011-08-17 | Paper |
A primal-dual approximation algorithm for min-sum single-machine scheduling problems
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2011-08-17 | Paper |
| The design of approximation algorithms | 2011-07-01 | Paper |
Approximation algorithms for the bottleneck asymmetric traveling salesman problem
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
Improved lower bounds for the universal and a priori TSP
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
Primal-dual algorithms for deterministic inventory problems
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
Lagrangian relaxation for the \(k\)-median problem: new insights and continuity properties
Lecture Notes in Computer Science | 2010-03-03 | Paper |
A PTAS for capacitated sum-of-ratios optimization
Operations Research Letters | 2009-08-14 | Paper |
Approximation Algorithms for Capacitated Stochastic Inventory Control Models
Operations Research | 2009-08-13 | Paper |
Primal-Dual Schema for Capacitated Covering Problems
Integer Programming and Combinatorial Optimization | 2008-06-10 | Paper |
A Constant Approximation Algorithm for the a priori Traveling Salesman Problem
Integer Programming and Combinatorial Optimization | 2008-06-10 | Paper |
Algorithms for the universal and a priori TSP
Operations Research Letters | 2008-05-29 | Paper |
Primal-Dual Algorithms for Deterministic Inventory Problems
Mathematics of Operations Research | 2008-05-27 | Paper |
Provably Near-Optimal Sampling-Based Policies for Stochastic Inventory Control Models
Mathematics of Operations Research | 2008-05-27 | Paper |
Approximation Algorithms for Stochastic Inventory Control Models
Mathematics of Operations Research | 2008-05-27 | Paper |
Approximation Algorithms for 2-Stage Stochastic Optimization Problems
FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science | 2008-04-17 | Paper |
Approximation Algorithms for 2-Stage Stochastic Scheduling Problems
Integer Programming and Combinatorial Optimization | 2007-11-29 | Paper |
Approximation Algorithms for Stochastic Inventory Control Models
Integer Programming and Combinatorial Optimization | 2007-08-30 | Paper |
Inventory and Facility Location Models with Market Selection
Integer Programming and Combinatorial Optimization | 2007-08-30 | Paper |
Integer Programming and Combinatorial Optimization
Lecture Notes in Computer Science | 2005-12-23 | Paper |
| scientific article; zbMATH DE number 2234850 (Why is no real title available?) | 2005-12-02 | Paper |
| scientific article; zbMATH DE number 2159272 (Why is no real title available?) | 2005-04-19 | Paper |
An improved approximation algorithm for the partial Latin square extension problem.
Operations Research Letters | 2005-01-11 | Paper |
| scientific article; zbMATH DE number 2102785 (Why is no real title available?) | 2004-09-24 | Paper |
Approximations and randomization to boost CSP techniques
Annals of Operations Research | 2004-08-20 | Paper |
| scientific article; zbMATH DE number 2079405 (Why is no real title available?) | 2004-07-28 | Paper |
Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
SIAM Journal on Computing | 2004-01-08 | Paper |
A constant-factor approximation algorithm for the k-median problem
Journal of Computer and System Sciences | 2003-05-04 | Paper |
A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem
Information Processing Letters | 2002-07-25 | Paper |
Karp and Smale receive National Medals of Science.
Notices of the American Mathematical Society | 2002-02-04 | Paper |
| scientific article; zbMATH DE number 1670526 (Why is no real title available?) | 2001-11-11 | Paper |
| scientific article; zbMATH DE number 1559542 (Why is no real title available?) | 2001-02-28 | Paper |
Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds
Journal of Algorithms | 1999-10-17 | Paper |
Improved bounds on relaxations of a parallel machine scheduling problem
Journal of Combinatorial Optimization | 1999-05-05 | Paper |
| scientific article; zbMATH DE number 1305496 (Why is no real title available?) | 1999-01-01 | Paper |
| scientific article; zbMATH DE number 1182758 (Why is no real title available?) | 1998-08-02 | Paper |
Short Shop Schedules
Operations Research | 1998-07-06 | 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 |
| scientific article; zbMATH DE number 1003253 (Why is no real title available?) | 1997-04-23 | Paper |
Scheduling Parallel Machines On-Line
SIAM Journal on Computing | 1996-09-15 | Paper |
| scientific article; zbMATH DE number 863498 (Why is no real title available?) | 1996-08-18 | Paper |
| scientific article; zbMATH DE number 871909 (Why is no real title available?) | 1996-04-28 | Paper |
| scientific article; zbMATH DE number 863509 (Why is no real title available?) | 1996-04-08 | Paper |
Fast Approximation Algorithms for Fractional Packing and Covering Problems
Mathematics of Operations Research | 1995-09-17 | Paper |
| scientific article; zbMATH DE number 780787 (Why is no real title available?) | 1995-07-31 | Paper |
An approximation algorithm for the generalized assignment problem
Mathematical Programming. Series A. Series B | 1995-01-19 | Paper |
Improved Approximation Algorithms for Shop Scheduling Problems
SIAM Journal on Computing | 1994-08-14 | Paper |
| scientific article; zbMATH DE number 437570 (Why is no real title available?) | 1993-12-15 | Paper |
| scientific article; zbMATH DE number 432815 (Why is no real title available?) | 1993-10-20 | Paper |
Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
Mathematics of Operations Research | 1993-01-16 | Paper |
| scientific article; zbMATH DE number 65706 (Why is no real title available?) | 1992-09-27 | Paper |
Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems
SIAM Journal on Computing | 1992-06-28 | Paper |
Permutation vs. non-permutation flow shop schedules
Operations Research Letters | 1992-06-27 | Paper |
Approximation algorithms for scheduling unrelated parallel machines
Mathematical Programming. Series A. Series B | 1990-01-01 | Paper |
Analyzing the Held-Karp TSP bound: A monotonicity property with application
Information Processing Letters | 1990-01-01 | Paper |
Flipping Persuasively in Constant Time
SIAM Journal on Computing | 1990-01-01 | Paper |
Simple constant-time consensus protocols in realistic failure models
Journal of the ACM | 1989-01-01 | Paper |
The parallel complexity of TSP heuristics
Journal of Algorithms | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4087453 (Why is no real title available?) | 1988-01-01 | Paper |
A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
SIAM Journal on Computing | 1988-01-01 | Paper |
Efficient parallel algorithms for edge coloring problems
Journal of Algorithms | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4011924 (Why is no real title available?) | 1986-01-01 | Paper |
A better than “best possible” algorithm to edge color multigraphs
Journal of Algorithms | 1986-01-01 | Paper |
Best possible heuristics for the bottleneck wandering salesperson and bottleneck vehicle routing problem
European Journal of Operational Research | 1986-01-01 | Paper |
A Packing Problem You Can Almost Solve by Sitting on Your Suitcase
SIAM Journal on Algebraic Discrete Methods | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4027206 (Why is no real title available?) | 1985-01-01 | Paper |
A Best Possible Heuristic for the <i>k</i>-Center Problem
Mathematics of Operations Research | 1985-01-01 | Paper |
An $O ( | V |^2 )$ Algorithm for the Planar 3-Cut Problem
SIAM Journal on Algebraic Discrete Methods | 1985-01-01 | Paper |
Recognizing graphs with fixed interval number is NP-complete
Discrete Applied Mathematics | 1984-01-01 | Paper |
