| Publication | Date of Publication | Type |
|---|
| 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 |
| A Heuristic Approach to the Multi-Period Single-Sourcing Problem with Production and Inventory Capacities and Perishability Constraints | 2012-06-18 | 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 |
| 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 |
| Single-machine scheduling with stepwise tardiness costs and release times | 2012-01-18 | Paper |
| Incremental Network Optimization: Theory and Algorithms | 2011-11-24 | Paper |
| Fast Algorithms for Specially Structured Minimum Cost Flow Problems with Applications | 2011-11-17 | Paper |
| Lower bounding techniques for the degree-constrained network design problem | 2010-11-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3056948 | 2010-11-23 | Paper |
| A New Linear Programming Approach to Radiation Therapy Treatment Planning Problems | 2009-08-13 | Paper |
| Exact and Heuristic Algorithms for the Weapon-Target Assignment Problem | 2009-08-13 | Paper |
| TECHNICAL NOTE—Solving Linear Cost Dynamic Lot-Sizing Problems in O(n log n) Time | 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 |
| Neighborhood search approaches to beam orientation optimization in intensity modulated radiation therapy treatment planning | 2009-05-04 | Paper |
| Optimal network configuration and capacity expansion of railroads | 2008-08-14 | Paper |
| New approaches for solving the block‐to‐train assignment problem | 2008-01-08 | Paper |
| Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem | 2006-05-29 | Paper |
| A Column Generation Approach to Radiation Therapy Treatment Planning Using Aperture Modulation | 2005-09-16 | Paper |
| A network flow algorithm to minimize beam‐on time for unconstrained multileaf collimator problems in cancer radiation therapy | 2005-02-23 | 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 |
| 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 |
| Solving Inverse Spanning Tree Problems Through Network Flow Techniques | 2002-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4509383 | 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 |
| The balanced linear programming problem | 2000-01-18 | 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 |
| A polynomial-time algorithm for message routing in hierarchical communication networks | 1998-11-05 | Paper |
| Optimal expansion of capacitated transshipment networks | 1998-10-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4398374 | 1998-07-19 | Paper |
| A new pivot selection rule for the network simplex algorithm | 1998-06-22 | 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 |
| A capacity scaling algorithm for the constrained maximum flow problem | 1995-09-27 | 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 |
| Some Recent Advances in Network Flows | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5202489 | 1991-01-01 | Paper |
| Faster algorithms for the shortest path problem | 1990-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 |
| Minimum cost-reliability ratio path problem | 1988-01-01 | Paper |
| Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem | 1987-01-01 | Paper |
| New lower planes for the network design problem | 1987-01-01 | Paper |
| Algorithms for the minimax transportation problem | 1986-01-01 | Paper |
| Minimax linear programming problem | 1985-01-01 | Paper |
| A parametric algorithm for convex cost network flow and related problems | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3666614 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4750427 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3912367 | 1981-01-01 | Paper |
