Ravindra K. Ahuja

Christian Liebchen

Networks, 2011

Iterative algorithms for the curfew planning problem.

[BibT_eX]

[DOI]

Suat Bog

Ashish K. Nemani

J. Oper. Res. Soc., 2011

2010

Solving the Curfew Planning Problem.

[BibT_eX]

[DOI]

Ashish K. Nemani

Suat Bog

Transp. Sci., 2010

Fast Algorithms for Specially Structured Minimum Cost Flow Problems with Applications.

[BibT_eX]

[DOI]

Oper. Res., 2010

2009

Railroad Crew Scheduling.

[BibT_eX]

[DOI]

Arvind Kumar

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Railroad Locomotive Scheduling.

[BibT_eX]

[DOI]

Arvind Kumar

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Minimum Cost Flow Problem.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Maximum Flow Problem.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Lower bounding techniques for the degree-constrained network design problem.

[BibT_eX]

[DOI]

Güvenç Sahin

Networks, 2009

Incremental Network Optimization: Theory and Algorithms.

[BibT_eX]

[DOI]

Onur Seref

Oper. Res., 2009

2008

The Locomotive Routing Problem.

[BibT_eX]

[DOI]

Transp. Sci., 2008

New approaches for solving the block-to-train assignment problem.

[BibT_eX]

[DOI]

Güvenç Sahin

Networks, 2008

Optimal network configuration and capacity expansion of railroads.

[BibT_eX]

[DOI]

Jian Liu

Güvenç Sahin

J. Oper. Res. Soc., 2008

Neighborhood search approaches to beam orientation optimization in intensity modulated radiation therapy treatment planning.

[BibT_eX]

[DOI]

J. Glob. Optim., 2008

Technical Note - Solving Linear Cost Dynamic Lot-Sizing Problems in O(n log n) Time.

[BibT_eX]

[DOI]

Dorit S. Hochbaum

Oper. Res., 2008

2007

Very Large-Scale Neighborhood Search.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Exact and Heuristic Algorithms for the Weapon-Target Assignment Problem.

[BibT_eX]

[DOI]

Oper. Res., 2007

Solving Real-Life Railroad Blocking Problems.

[BibT_eX]

[DOI]

Jian Liu

Interfaces, 2007

Very Large-Scale Neighborhood Search for the Quadratic Assignment Problem.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2007

A Heuristic Approach to the Multi-Period Single-Sourcing Problem with Production and Inventory Capacities and Perishability Constraints.

[BibT_eX]

[DOI]

Wei Huang

H. Edwin Romeijn

Dolores Romero Morales

INFORMS J. Comput., 2007

A Very Large-Scale Neighborhood Search Algorithm for the Combined Through-Fleet-Assignment Model.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2007

Multicommodity network flow approach to the railroad crew-scheduling problem.

[BibT_eX]

[DOI]

IBM J. Res. Dev., 2007

A Simulation/Optimization Framework for Locomotive Planning.

[BibT_eX]

[DOI]

Proceedings of the ATMOS 2007, 2007

ATMOS 2007 Preface - 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems.

[BibT_eX]

[DOI]

Christian Liebchen

Juan A. Mesa

Proceedings of the ATMOS 2007, 2007

ATMOS 2007 Abstracts Collection - 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems.

[BibT_eX]

[DOI]

Christian Liebchen

Juan A. Mesa

Proceedings of the ATMOS 2007, 2007

2006

A New Linear Programming Approach to Radiation Therapy Treatment Planning Problems.

[BibT_eX]

[DOI]

Oper. Res., 2006

2005

Solving Real-Life Locomotive-Scheduling Problems.

[BibT_eX]

[DOI]

Transp. Sci., 2005

A Column Generation Approach to Radiation Therapy Treatment Planning Using Aperture Modulation.

[BibT_eX]

[DOI]

SIAM J. Optim., 2005

A network flow algorithm to minimize beam-on time for unconstrained multileaf collimator problems in cancer radiation therapy.

[BibT_eX]

[DOI]

Horst W. Hamacher

Networks, 2005

Very Large-Scale Neighborhood Search for the K-Constraint Multiple Knapsack Problem.

[BibT_eX]

[DOI]

Claudio Barbieri da Cunha

J. Heuristics, 2005

2004

A Composite Very-Large-Scale Neighborhood Search Algorithm for the Vehicle Routing Problem.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Scheduling - Algorithms, Models, and Performance Analysis., 2004

A neighborhood search algorithm for the combined through and fleet assignment model with time windows.

[BibT_eX]

[DOI]

Networks, 2004

A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem.

[BibT_eX]

[DOI]

Maria Grazia Scutellà

Manag. Sci., 2004

A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem.

[BibT_eX]

[DOI]

Dorit S. Hochbaum

Algorithmica, 2004

2003

A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem.

[BibT_eX]

[DOI]

Dushyant Sharma

Oper. Res. Lett., 2003

Dynamic shortest paths minimizing travel times and costs.

[BibT_eX]

[DOI]

Stefano Pallottino

Maria Grazia Scutellà

Networks, 2003

Solving the Convex Cost Integer Dual Network Flow Problem.

[BibT_eX]

[DOI]

Dorit S. Hochbaum

Manag. Sci., 2003

2002

Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights.

[BibT_eX]

[DOI]

Stefano Pallottino

Maria Grazia Scutellà

Transp. Sci., 2002

A network simplex algorithm with O(n) consecutive degenerate pivots.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2002

Combinatorial algorithms for inverse network flow problems.

[BibT_eX]

[DOI]

Networks, 2002

A survey of very large-scale neighborhood search techniques.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

2001

Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem.

[BibT_eX]

[DOI]

Dushyant Sharma

Math. Program., 2001

A Fast Scaling Algorithm for Minimizing Separable Convex Functions Subject to Chain Constraints.

[BibT_eX]

[DOI]

Oper. Res., 2001

Inverse Optimization.

[BibT_eX]

[DOI]

Oper. Res., 2001

2000

New polynomial-time cycle-canceling algorithms for minimum-cost flows.

[BibT_eX]

[DOI]

P. T. Sokkalingam

Networks, 2000

A Faster Algorithm for the Inverse Spanning Tree Problem.

[BibT_eX]

[DOI]

J. Algorithms, 2000

A greedy genetic algorithm for the quadratic assignment problem.

[BibT_eX]

[DOI]

Ashish Tiwari

Comput. Oper. Res., 2000

1999

Networks And Flows.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999

Solving Inverse Spanning Tree Problems Through Network Flow Techniques.

[BibT_eX]

[DOI]

P. T. Sokkalingam

Oper. Res., 1999

1998

Diagnosing infeasibilities in network flow problems.

[BibT_eX]

[DOI]

Math. Program., 1998

1997

Equivalence of the primal and dual simplex algorithms for the maximum flow problem.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1997

A new pivot selection rule for the network simplex algorithm.

[BibT_eX]

[DOI]

P. T. Sokkalingam

Prabha Sharma

Math. Program., 1997

Developing Fitter Genetic Algorithms.

[BibT_eX]

[DOI]

INFORMS J. Comput., 1997

1996

Use of Representative Operation Counts in Computational Testing of Algorithms.

[BibT_eX]

[DOI]

INFORMS J. Comput., 1996

1995

A capacity scaling algorithm for the constrained maximum flow problem.

[BibT_eX]

[DOI]

Networks, 1995

1994

Improved Algorithms for Bipartite Network Flow.

[BibT_eX]

[DOI]

SIAM J. Comput., 1994

1993

Network flows - theory, algorithms and applications.

[BibT_eX]

Prentice Hall, ISBN: 978-0-13-617549-0, 1993

1992

New scaling algorithms for the assignment and minimum mean cycle problems.

[BibT_eX]

[DOI]

Math. Program., 1992

Finding minimum-cost flows by double scaling.

[BibT_eX]

[DOI]

Math. Program., 1992

The Scaling Network Simplex Algorithm.

[BibT_eX]

[DOI]

Oper. Res., 1992

1991

Some Recent Advances in Network Flows.

[BibT_eX]

[DOI]

SIAM Rev., 1991

1990

Faster Algorithms for the Shortest Path Problem

[BibT_eX]

[DOI]

J. ACM, April, 1990

1989

Improved Time Bounds for the Maximum Flow Problem.

[BibT_eX]

[DOI]

Robert Endre Tarjan

SIAM J. Comput., 1989

A Fast and Simple Algorithm for the Maximum Flow Problem.

[BibT_eX]

[DOI]

Oper. Res., 1989

1988

Minimum cost-reliability ratio path problem.

[BibT_eX]

[DOI]