| Publication | Date of Publication | Type |
|---|
Very large-scale neighborhood search
International Transactions in Operational Research | 2026-02-25 | Paper |
Directed shortest paths via approximate cost balancing
Journal of the ACM | 2024-07-04 | Paper |
| Distributionally robust max flows | 2024-05-14 | Paper |
Directed shortest paths via approximate cost balancing
(available as arXiv preprint) | 2024-01-15 | Paper |
A fast maximum flow algorithm
Networks | 2023-12-11 | Paper |
A fast maximum flow algorithm
Networks | 2023-12-11 | Paper |
| Linearizable special cases of the quadratic shortest path problem | 2022-06-08 | Paper |
| scientific article; zbMATH DE number 7051294 (Why is no real title available?) | 2019-05-06 | 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 |
On the power of randomization in network interdiction
Operations Research Letters | 2018-09-28 | Paper |
On the power of randomization in network interdiction
Operations Research Letters | 2018-09-28 | Paper |
On the complexity of energy storage problems
Discrete Optimization | 2018-08-17 | Paper |
An O(nm) time algorithm for finding the min length directed cycle in a graph
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
A characterization of irreducible infeasible subsystems in flow networks
Networks | 2018-05-23 | Paper |
| scientific article; zbMATH DE number 6863577 (Why is no real title available?) | 2018-04-23 | Paper |
| Minimum cost flow problem | 2018-04-23 | Paper |
| Multicommodity flows | 2018-04-23 | Paper |
Randomized algorithms for finding the shortest negative cost cycle in networks
Discrete Applied Mathematics | 2018-01-11 | Paper |
A computationally efficient FPTAS for convex stochastic dynamic programs
SIAM Journal on Optimization | 2017-01-13 | Paper |
Robust monotone submodular function maximization
Integer Programming and Combinatorial Optimization | 2016-08-10 | Paper |
Fast algorithms for convex cost flow problems on circles, lines, and trees
Networks | 2016-06-10 | Paper |
| Approximate local search in combinatorial optimization | 2015-08-03 | Paper |
Fully polynomial time approximation schemes for stochastic dynamic programs
SIAM Journal on Discrete Mathematics | 2015-04-17 | 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 |
On the sum-of-squares algorithm for bin packing
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
Improved algorithms for computing Fisher's market clearing prices
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Max flows in O(nm) time, or better
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
On the hardness of finding subsets with equal average
Information Processing Letters | 2014-04-11 | Paper |
A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Simplifications and speedups of the pseudoflow algorithm
Networks | 2013-08-06 | Paper |
A simple approximation algorithm for computing Arrow-Debreu prices
Operations Research | 2013-01-30 | Paper |
Approximating the nonlinear newsvendor and single-item stochastic lot-sizing problems when data is given by an oracle
Operations Research | 2012-10-01 | Paper |
A very large-scale neighborhood search algorithm for the combined through-fleet-assignment model
INFORMS Journal on Computing | 2012-06-18 | Paper |
Very large-scale neighborhood search for the quadratic assignment problem
INFORMS Journal on Computing | 2012-06-18 | Paper |
Adaptive data-driven inventory control with censored demand based on Kaplan-Meier estimator
Operations Research | 2012-03-26 | Paper |
A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
Management Science | 2012-02-19 | Paper |
Solving the convex cost integer dual network flow problem
Management Science | 2012-02-19 | Paper |
Algorithms for the simple equal flow problem
Management Science | 2012-02-12 | Paper |
Incremental network optimization: theory and algorithms
Operations Research | 2011-11-24 | Paper |
Complexity results for equistable graphs and related classes
Annals of Operations Research | 2011-11-17 | Paper |
| Network flows. Theory, algorithms, and applications. | 2010-11-23 | Paper |
| scientific article; zbMATH DE number 5764859 (Why is no real title available?) | 2010-08-06 | Paper |
PACKING SHELVES WITH ITEMS THAT DIVIDE THE SHELVES' LENGTH: A CASE OF A UNIVERSAL NUMBER PARTITION PROBLEM
Discrete Mathematics, Algorithms and Applications | 2010-07-27 | Paper |
A faster algorithm for the single source shortest path problem with few distinct positive lengths
Journal of Discrete Algorithms | 2010-05-25 | Paper |
Integer Programming: Optimization and Evaluation Are Equivalent
Lecture Notes in Computer Science | 2009-10-20 | Paper |
Lexicographically Minimum and Maximum Load Linear Programming Problems
Operations Research | 2009-08-13 | Paper |
Exact and Heuristic Algorithms for the Weapon-Target Assignment Problem
Operations Research | 2009-08-13 | Paper |
A Fast Scaling Algorithm for Minimizing Separable Convex Functions Subject to Chain Constraints
Operations Research | 2009-07-03 | Paper |
Inverse Optimization
Operations Research | 2009-07-03 | Paper |
A faster strongly polynomial time algorithm for submodular function minimization
Mathematical Programming. Series A. Series B | 2009-05-04 | Paper |
On the Sum-of-Squares algorithm for bin packing
Journal of the ACM | 2008-12-21 | Paper |
Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets
SIAM Journal on Discrete Mathematics | 2008-12-05 | Paper |
-optimization schemes and L-bit precision: alternative perspectives for solving combinatorial optimization problems
Discrete Optimization | 2008-10-29 | Paper |
Scale-invariant clustering with minimum volume ellipsoids
Computers & Operations Research | 2008-09-01 | Paper |
A Fast, Simpler Algorithm for the Matroid Parity Problem
Integer Programming and Combinatorial Optimization | 2008-06-10 | Paper |
Scheduling malleable tasks with interdependent processing rates: comments and observations
Discrete Applied Mathematics | 2008-03-18 | Paper |
Probabilistic Analysis of Unit-Demand Vehicle Routeing Problems
Journal of Applied Probability | 2008-02-22 | Paper |
A simple method for improving the primal simplex method for the multicommodity flow problem
Networks | 2008-01-08 | Paper |
A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization
Integer Programming and Combinatorial Optimization | 2007-11-29 | Paper |
Using Grammars to Generate Very Large Scale Neighborhoods for the Traveling Salesman Problem and Other Sequencing Problems
Integer Programming and Combinatorial Optimization | 2007-08-30 | Paper |
Improved bounds for vehicle routing solutions
Discrete Optimization | 2007-02-20 | Paper |
THE TSP AND THE SUM OF ITS MARGINAL VALUES
International Journal of Computational Geometry & Applications | 2006-09-04 | Paper |
A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem
Discrete Optimization | 2006-06-30 | Paper |
Creating very large scale neighborhoods out of smaller ones by compounding moves
Journal of Heuristics | 2006-05-29 | Paper |
Fast neighborhood search for the single machine total weighted tardiness problem
Operations Research Letters | 2006-01-18 | Paper |
Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs
Mathematical Programming. Series A. Series B | 2005-04-19 | Paper |
Extended neighborhood: Definition and characterization
Mathematical Programming. Series A. Series B | 2005-02-24 | Paper |
Approximate Local Search in Combinatorial Optimization
SIAM Journal on Computing | 2005-02-21 | Paper |
A neighborhood search algorithm for the combined through and fleet assignment model with time windows
Networks | 2005-01-12 | Paper |
A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem
Algorithmica | 2004-12-13 | Paper |
| scientific article; zbMATH DE number 2050792 (Why is no real title available?) | 2004-03-07 | Paper |
Dynamic shortest paths minimizing travel times and costs
Networks | 2003-07-31 | Paper |
| scientific article; zbMATH DE number 1947395 (Why is no real title available?) | 2003-07-08 | Paper |
Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights
Transportation Science | 2003-06-29 | Paper |
A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem.
Operations Research Letters | 2003-06-17 | Paper |
A network simplex algorithm with O(\(n\)) consecutive degenerate pivots
Operations Research Letters | 2003-04-02 | Paper |
Combinatorial algorithms for inverse network flow problems
Networks | 2003-03-19 | Paper |
A survey of very large-scale neighborhood search techniques
Discrete Applied Mathematics | 2002-09-17 | Paper |
A scaling algorithm for multicommodity flow problems
Operations Research | 2002-07-31 | Paper |
On multiroute maximum flows in networks.
Networks | 2002-04-08 | Paper |
Solving inverse spanning tree problems through network flow techniques
Operations Research | 2002-02-07 | Paper |
| New polynomial-time cycle-canceling algorithms for minimum-cost flows | 2001-10-04 | Paper |
A Faster Algorithm for the Inverse Spanning Tree Problem
Journal of Algorithms | 2001-09-10 | Paper |
Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
Mathematical Programming. Series A. Series B | 2001-01-01 | Paper |
A greedy genetic algorithm for the quadratic assignment problem
Computers & Operations Research | 2000-09-04 | Paper |
Optimal Rounding of Instantaneous Fractional Flows Over Time
SIAM Journal on Discrete Mathematics | 2000-07-20 | Paper |
| scientific article; zbMATH DE number 1342118 (Why is no real title available?) | 1999-09-22 | Paper |
Diagnosing infeasibilities in network flow problems
Mathematical Programming. Series A. Series B | 1999-09-05 | Paper |
Computational investigations of maximum flow algorithms
European Journal of Operational Research | 1999-02-22 | Paper |
| scientific article; zbMATH DE number 1156622 (Why is no real title available?) | 1998-12-10 | Paper |
Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem
Mathematics of Operations Research | 1998-08-03 | Paper |
A polynomial time primal network simplex algorithm for minimum cost flows
Mathematical Programming. Series A. Series B | 1997-11-25 | Paper |
A Parametric Worst Case Analysis of the LPT Heuristic for Two Uniform Machines
Operations Research | 1997-11-25 | Paper |
Optimized Crossover for the Independent Set Problem
Operations Research | 1997-11-25 | Paper |
Equivalence of the primal and dual simplex algorithms for the maximum flow problem
Operations Research Letters | 1997-08-05 | Paper |
Use of Representative Operation Counts in Computational Testing of Algorithms
INFORMS Journal on Computing | 1997-05-20 | Paper |
Improved Algorithms for Bipartite Network Flow
SIAM Journal on Computing | 1996-07-04 | Paper |
| scientific article; zbMATH DE number 871946 (Why is no real title available?) | 1996-06-18 | Paper |
A capacity scaling algorithm for the constrained maximum flow problem
Networks | 1995-09-27 | Paper |
| scientific article; zbMATH DE number 742961 (Why is no real title available?) | 1995-04-11 | Paper |
A technique for speeding up the solution of the Lagrangean dual
Mathematical Programming. Series A. Series B | 1995-02-19 | Paper |
A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
Journal of Algorithms | 1994-12-14 | Paper |
| scientific article; zbMATH DE number 679866 (Why is no real title available?) | 1994-10-30 | Paper |
Finding minimum cost to time ratio cycles with small integral transit times
Networks | 1994-05-05 | Paper |
Parallel algorithms for the assignment and minimum-cost flow problems
Operations Research Letters | 1994-04-12 | Paper |
Polynomial dual network simplex algorithms
Mathematical Programming. Series A. Series B | 1993-12-06 | Paper |
| scientific article; zbMATH DE number 432813 (Why is no real title available?) | 1993-10-20 | Paper |
Determination of optimal vertices from feasible solutions in unimodular linear programming
Mathematical Programming. Series A. Series B | 1993-08-30 | Paper |
A Faster Strongly Polynomial Minimum Cost Flow Algorithm
Operations Research | 1993-08-09 | Paper |
Recognizing hidden bicircular networks
Discrete Applied Mathematics | 1993-05-16 | Paper |
New scaling algorithms for the assignment and minimum mean cycle problems
Mathematical Programming. Series A. Series B | 1992-09-26 | Paper |
Finding minimum-cost flows by double scaling
Mathematical Programming. Series A. Series B | 1992-06-28 | Paper |
The Scaling Network Simplex Algorithm
Operations Research | 1992-06-28 | Paper |
Single transferable vote resists strategic voting
Social Choice and Welfare | 1992-06-25 | Paper |
Solving the linear matroid parity problem as a sequence of matroid intersection problems
Mathematical Programming. Series A. Series B | 1992-06-25 | Paper |
| Distance-directed augmenting path algorithms for maximum flow and parametric maximum flow problems | 1991-01-01 | Paper |
Faster parametric shortest path and minimum‐balance algorithms
Networks | 1991-01-01 | Paper |
Some Recent Advances in Network Flows
SIAM Review | 1991-01-01 | Paper |
Faster algorithms for the shortest path problem
Journal of the ACM | 1990-01-01 | Paper |
Improved Time Bounds for the Maximum Flow Problem
SIAM Journal on Computing | 1989-01-01 | Paper |
A Fast and Simple Algorithm for the Maximum Flow Problem
Operations Research | 1989-01-01 | Paper |
The structure of bases in bicircular matroids
Discrete Applied Mathematics | 1989-01-01 | Paper |
Parametric linear programming and anti-cycling pivoting rules
Mathematical Programming. Series A. Series B | 1988-01-01 | Paper |
A dual version of Tardos's algorithm for linear programming
Operations Research Letters | 1986-01-01 | Paper |
On the simplex algorithm for networks and generalized networks
Mathematical Programming Essays in Honor of George B. Dantzig Part I | 1985-01-01 | Paper |
A minimum concave-cost dynamic network flow problem with an application to lot-sizing
Networks | 1985-01-01 | Paper |
On the complexity of four polyhedral set containment problems
Mathematical Programming | 1985-01-01 | Paper |
Consecutive Optimizers for a Partitioning Problem with Applications to Optimal Inventory Groupings for Joint Replenishment
Operations Research | 1985-01-01 | Paper |
A finitely converging cutting plane technique
Operations Research Letters | 1985-01-01 | Paper |
Technical Note—Some Very Easy Knapsack/Partition Problems
Operations Research | 1985-01-01 | Paper |
Computing optimal scalings by parametric network algorithms
Mathematical Programming | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3871422 (Why is no real title available?) | 1984-01-01 | Paper |
Minimum Convex Cost Dynamic Network Flows
Mathematics of Operations Research | 1984-01-01 | Paper |
Dynamic matchings and quasidynamic fractional matchings. II
Networks | 1983-01-01 | Paper |
Dynamic matchings and quasidynamic fractional matchings. I
Networks | 1983-01-01 | Paper |
Maximum-throughput dynamic network flows
Mathematical Programming | 1983-01-01 | Paper |
A polynomial algorithm for integer programming covering problems satisfying the integer round-up property
Mathematical Programming | 1982-01-01 | Paper |
Technical Note—A Partitioning Problem with Additive Objective with an Application to Optimal Inventory Groupings for Joint Replenishment
Operations Research | 1982-01-01 | Paper |
Minimizing the Number of Vehicles to Meet a Fixed Periodic Schedule: An Application of Periodic Posets
Operations Research | 1982-01-01 | Paper |
An O(n^2 ) Algorithm for Coloring Proper Circular Arc Graphs
SIAM Journal on Algebraic Discrete Methods | 1981-01-01 | Paper |
Parametric shortest path algorithms with an application to cyclic staffing
Discrete Applied Mathematics | 1981-01-01 | Paper |
Cyclic Scheduling via Integer Programs with Circular Ones
Operations Research | 1980-01-01 | Paper |
Line-digraphs, arborescences and theorems of Tutte and Knuth
Journal of Combinatorial Theory. Series B | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3582190 (Why is no real title available?) | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3561379 (Why is no real title available?) | 1977-01-01 | Paper |
