| Publication | Date of Publication | Type |
|---|
| Directed shortest paths via approximate cost balancing | 2024-07-04 | Paper |
| Distributionally robust max flows | 2024-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147263 | 2024-01-15 | Paper |
| A fast maximum flow algorithm | 2023-12-11 | Paper |
| Linearizable special cases of the quadratic shortest path problem | 2022-06-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633938 | 2019-05-06 | Paper |
| Robust monotone submodular function maximization | 2018-10-26 | Paper |
| On the power of randomization in network interdiction | 2018-09-28 | Paper |
| On the complexity of energy storage problems | 2018-08-17 | Paper |
| An O(nm) time algorithm for finding the min length directed cycle in a graph | 2018-07-16 | Paper |
| A characterization of irreducible infeasible subsystems in flow networks | 2018-05-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4635958 | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4635959 | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4635960 | 2018-04-23 | Paper |
| Randomized algorithms for finding the shortest negative cost cycle in networks | 2018-01-11 | Paper |
| A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs | 2017-01-13 | Paper |
| Robust Monotone Submodular Function Maximization | 2016-08-10 | Paper |
| Fast algorithms for convex cost flow problems on circles, lines, and trees | 2016-06-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501313 | 2015-08-03 | Paper |
| Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs | 2015-04-17 | Paper |
| On the sum-of-squares algorithm for bin packing | 2014-09-26 | Paper |
| ε -optimization schemes and L-bit precision (extended abstract) | 2014-09-26 | Paper |
| Improved algorithms for computing fisher's market clearing prices | 2014-08-13 | Paper |
| Max flows in O(nm) time, or better | 2014-08-07 | Paper |
| On the hardness of finding subsets with equal average | 2014-04-11 | Paper |
| A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs | 2013-09-17 | Paper |
| Simplifications and speedups of the pseudoflow algorithm | 2013-08-06 | Paper |
| A Simple Approximation Algorithm for Computing Arrow-Debreu Prices | 2013-01-30 | Paper |
| Approximating the Nonlinear Newsvendor and Single-Item Stochastic Lot-Sizing Problems When Data Is Given by an Oracle | 2012-10-01 | Paper |
| A Very Large-Scale Neighborhood Search Algorithm for the Combined Through-Fleet-Assignment Model | 2012-06-18 | Paper |
| Very Large-Scale Neighborhood Search for the Quadratic Assignment Problem | 2012-06-18 | Paper |
| Adaptive Data-Driven Inventory Control with Censored Demand Based on Kaplan-Meier Estimator | 2012-03-26 | Paper |
| Solving the Convex Cost Integer Dual Network Flow Problem | 2012-02-19 | Paper |
| A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem | 2012-02-19 | Paper |
| Algorithms for the Simple Equal Flow Problem | 2012-02-12 | Paper |
| Incremental Network Optimization: Theory and Algorithms | 2011-11-24 | Paper |
| Complexity results for equistable graphs and related classes | 2011-11-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3056948 | 2010-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579452 | 2010-08-06 | Paper |
| PACKING SHELVES WITH ITEMS THAT DIVIDE THE SHELVES' LENGTH: A CASE OF A UNIVERSAL NUMBER PARTITION PROBLEM | 2010-07-27 | Paper |
| A faster algorithm for the single source shortest path problem with few distinct positive lengths | 2010-05-25 | Paper |
| Integer Programming: Optimization and Evaluation Are Equivalent | 2009-10-20 | Paper |
| Lexicographically Minimum and Maximum Load Linear Programming Problems | 2009-08-13 | Paper |
| Exact and Heuristic Algorithms for the Weapon-Target Assignment Problem | 2009-08-13 | Paper |
| Inverse Optimization | 2009-07-03 | Paper |
| A Fast Scaling Algorithm for Minimizing Separable Convex Functions Subject to Chain Constraints | 2009-07-03 | Paper |
| A faster strongly polynomial time algorithm for submodular function minimization | 2009-05-04 | Paper |
| On the Sum-of-Squares algorithm for bin packing | 2008-12-21 | Paper |
| Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets | 2008-12-05 | Paper |
| \(\varepsilon \)-optimization schemes and \(L\)-bit precision: alternative perspectives for solving combinatorial optimization problems | 2008-10-29 | Paper |
| Scale-invariant clustering with minimum volume ellipsoids | 2008-09-01 | Paper |
| A Fast, Simpler Algorithm for the Matroid Parity Problem | 2008-06-10 | Paper |
| Scheduling malleable tasks with interdependent processing rates: comments and observations | 2008-03-18 | Paper |
| Probabilistic Analysis of Unit-Demand Vehicle Routeing Problems | 2008-02-22 | Paper |
| A simple method for improving the primal simplex method for the multicommodity flow problem | 2008-01-08 | Paper |
| A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization | 2007-11-29 | Paper |
| Using Grammars to Generate Very Large Scale Neighborhoods for the Traveling Salesman Problem and Other Sequencing Problems | 2007-08-30 | Paper |
| Improved bounds for vehicle routing solutions | 2007-02-20 | Paper |
| THE TSP AND THE SUM OF ITS MARGINAL VALUES | 2006-09-04 | Paper |
| A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem | 2006-06-30 | Paper |
| Creating very large scale neighborhoods out of smaller ones by compounding moves | 2006-05-29 | Paper |
| Fast neighborhood search for the single machine total weighted tardiness problem | 2006-01-18 | Paper |
| Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs | 2005-04-19 | Paper |
| Extended neighborhood: Definition and characterization | 2005-02-24 | Paper |
| Approximate Local Search in Combinatorial Optimization | 2005-02-21 | Paper |
| A neighborhood search algorithm for the combined through and fleet assignment model with time windows | 2005-01-12 | Paper |
| A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem | 2004-12-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4453003 | 2004-03-07 | Paper |
| Dynamic shortest paths minimizing travel times and costs | 2003-07-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411361 | 2003-07-08 | Paper |
| Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights | 2003-06-29 | Paper |
| A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem. | 2003-06-17 | Paper |
| A network simplex algorithm with O(\(n\)) consecutive degenerate pivots | 2003-04-02 | Paper |
| Combinatorial algorithms for inverse network flow problems | 2003-03-19 | Paper |
| A survey of very large-scale neighborhood search techniques | 2002-09-17 | Paper |
| A Scaling Algorithm for Multicommodity Flow Problems | 2002-07-31 | Paper |
| On multiroute maximum flows in networks | 2002-04-08 | Paper |
| Solving Inverse Spanning Tree Problems Through Network Flow Techniques | 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 | 2001-09-10 | Paper |
| Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem | 2001-01-01 | Paper |
| A greedy genetic algorithm for the quadratic assignment problem | 2000-09-04 | Paper |
| Optimal Rounding of Instantaneous Fractional Flows Over Time | 2000-07-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263700 | 1999-09-22 | Paper |
| Diagnosing infeasibilities in network flow problems | 1999-09-05 | Paper |
| Computational investigations of maximum flow algorithms | 1999-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4390652 | 1998-12-10 | Paper |
| Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem | 1998-08-03 | Paper |
| A polynomial time primal network simplex algorithm for minimum cost flows | 1997-11-25 | Paper |
| Optimized Crossover for the Independent Set Problem | 1997-11-25 | Paper |
| A Parametric Worst Case Analysis of the LPT Heuristic for Two Uniform Machines | 1997-11-25 | Paper |
| Equivalence of the primal and dual simplex algorithms for the maximum flow problem | 1997-08-05 | Paper |
| Use of Representative Operation Counts in Computational Testing of Algorithms | 1997-05-20 | Paper |
| Improved Algorithms for Bipartite Network Flow | 1996-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875221 | 1996-06-18 | Paper |
| A capacity scaling algorithm for the constrained maximum flow problem | 1995-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763403 | 1995-04-11 | Paper |
| A technique for speeding up the solution of the Lagrangean dual | 1995-02-19 | Paper |
| A Faster Algorithm for Finding the Minimum Cut in a Directed Graph | 1994-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4311913 | 1994-10-30 | Paper |
| Finding minimum cost to time ratio cycles with small integral transit times | 1994-05-05 | Paper |
| Parallel algorithms for the assignment and minimum-cost flow problems | 1994-04-12 | Paper |
| Polynomial dual network simplex algorithms | 1993-12-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138947 | 1993-10-20 | Paper |
| Determination of optimal vertices from feasible solutions in unimodular linear programming | 1993-08-30 | Paper |
| A Faster Strongly Polynomial Minimum Cost Flow Algorithm | 1993-08-09 | Paper |
| Recognizing hidden bicircular networks | 1993-05-16 | Paper |
| New scaling algorithms for the assignment and minimum mean cycle problems | 1992-09-26 | Paper |
| Finding minimum-cost flows by double scaling | 1992-06-28 | Paper |
| The Scaling Network Simplex Algorithm | 1992-06-28 | Paper |
| Single transferable vote resists strategic voting | 1992-06-25 | Paper |
| Solving the linear matroid parity problem as a sequence of matroid intersection problems | 1992-06-25 | Paper |
| Some Recent Advances in Network Flows | 1991-01-01 | 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 | 1991-01-01 | Paper |
| Faster algorithms for the shortest path problem | 1990-01-01 | Paper |
| The structure of bases in bicircular matroids | 1989-01-01 | Paper |
| A Fast and Simple Algorithm for the Maximum Flow Problem | 1989-01-01 | Paper |
| Improved Time Bounds for the Maximum Flow Problem | 1989-01-01 | Paper |
| Parametric linear programming and anti-cycling pivoting rules | 1988-01-01 | Paper |
| A dual version of Tardos's algorithm for linear programming | 1986-01-01 | Paper |
| A finitely converging cutting plane technique | 1985-01-01 | Paper |
| Computing optimal scalings by parametric network algorithms | 1985-01-01 | Paper |
| On the complexity of four polyhedral set containment problems | 1985-01-01 | Paper |
| Technical Note—Some Very Easy Knapsack/Partition Problems | 1985-01-01 | Paper |
| A minimum concave-cost dynamic network flow problem with an application to lot-sizing | 1985-01-01 | Paper |
| Consecutive Optimizers for a Partitioning Problem with Applications to Optimal Inventory Groupings for Joint Replenishment | 1985-01-01 | Paper |
| On the simplex algorithm for networks and generalized networks | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3338297 | 1984-01-01 | Paper |
| Minimum Convex Cost Dynamic Network Flows | 1984-01-01 | Paper |
| Dynamic matchings and quasidynamic fractional matchings. I | 1983-01-01 | Paper |
| Dynamic matchings and quasidynamic fractional matchings. II | 1983-01-01 | Paper |
| Maximum-throughput dynamic network flows | 1983-01-01 | Paper |
| A polynomial algorithm for integer programming covering problems satisfying the integer round-up property | 1982-01-01 | Paper |
| Minimizing the Number of Vehicles to Meet a Fixed Periodic Schedule: An Application of Periodic Posets | 1982-01-01 | Paper |
| Technical Note—A Partitioning Problem with Additive Objective with an Application to Optimal Inventory Groupings for Joint Replenishment | 1982-01-01 | Paper |
| Parametric shortest path algorithms with an application to cyclic staffing | 1981-01-01 | Paper |
| An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs | 1981-01-01 | Paper |
| Cyclic Scheduling via Integer Programs with Circular Ones | 1980-01-01 | Paper |
| Line-digraphs, arborescences and theorems of Tutte and Knuth | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4134007 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4152571 | 1977-01-01 | Paper |
