Ravindra K. Ahuja

According to our database1, Ravindra K. Ahuja authored at least 66 papers between 1988 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Very Large-Scale Neighborhood Search: Theory, Algrithms, and Applications.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2011
Special issue of <i>Networks</i> on optimization in scheduled transportation networks.
Networks, 2011

Iterative algorithms for the curfew planning problem.
J. Oper. Res. Soc., 2011

2010
Solving the Curfew Planning Problem.
Transp. Sci., 2010

Fast Algorithms for Specially Structured Minimum Cost Flow Problems with Applications.
Oper. Res., 2010

2009
Railroad Crew Scheduling.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Railroad Locomotive Scheduling.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Minimum Cost Flow Problem.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Maximum Flow Problem.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

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

Incremental Network Optimization: Theory and Algorithms.
Oper. Res., 2009

2008
The Locomotive Routing Problem.
Transp. Sci., 2008

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

Optimal network configuration and capacity expansion of railroads.
J. Oper. Res. Soc., 2008

Neighborhood search approaches to beam orientation optimization in intensity modulated radiation therapy treatment planning.
J. Glob. Optim., 2008

Technical Note - Solving Linear Cost Dynamic Lot-Sizing Problems in <i>O</i>(<i>n</i> log <i>n</i>) Time.
Oper. Res., 2008

2007
Very Large-Scale Neighborhood Search.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Exact and Heuristic Algorithms for the Weapon-Target Assignment Problem.
Oper. Res., 2007

Solving Real-Life Railroad Blocking Problems.
Interfaces, 2007

Very Large-Scale Neighborhood Search for the Quadratic Assignment Problem.
INFORMS J. Comput., 2007

A Heuristic Approach to the Multi-Period Single-Sourcing Problem with Production and Inventory Capacities and Perishability Constraints.
INFORMS J. Comput., 2007

A Very Large-Scale Neighborhood Search Algorithm for the Combined Through-Fleet-Assignment Model.
INFORMS J. Comput., 2007

Multicommodity network flow approach to the railroad crew-scheduling problem.
IBM J. Res. Dev., 2007

A Simulation/Optimization Framework for Locomotive Planning.
Proceedings of the ATMOS 2007, 2007

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

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

2006
A New Linear Programming Approach to Radiation Therapy Treatment Planning Problems.
Oper. Res., 2006

2005
Solving Real-Life Locomotive-Scheduling Problems.
Transp. Sci., 2005

A Column Generation Approach to Radiation Therapy Treatment Planning Using Aperture Modulation.
SIAM J. Optim., 2005

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

Very Large-Scale Neighborhood Search for the <i>K</i>-Constraint Multiple Knapsack Problem.
J. Heuristics, 2005

2004
A Composite Very-Large-Scale Neighborhood Search Algorithm for the Vehicle Routing Problem.
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.
Networks, 2004

A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem.
Manag. Sci., 2004

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

2003
A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem.
Oper. Res. Lett., 2003

Dynamic shortest paths minimizing travel times and costs.
Networks, 2003

Solving the Convex Cost Integer Dual Network Flow Problem.
Manag. Sci., 2003

2002
Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights.
Transp. Sci., 2002

A network simplex algorithm with O(<i>n</i>) consecutive degenerate pivots.
Oper. Res. Lett., 2002

Combinatorial algorithms for inverse network flow problems.
Networks, 2002

A survey of very large-scale neighborhood search techniques.
Discret. Appl. Math., 2002

2001
Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem.
Math. Program., 2001

A Fast Scaling Algorithm for Minimizing Separable Convex Functions Subject to Chain Constraints.
Oper. Res., 2001

Inverse Optimization.
Oper. Res., 2001

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

A Faster Algorithm for the Inverse Spanning Tree Problem.
J. Algorithms, 2000

A greedy genetic algorithm for the quadratic assignment problem.
Comput. Oper. Res., 2000

1999
Networks And Flows.
Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999

Solving Inverse Spanning Tree Problems Through Network Flow Techniques.
Oper. Res., 1999

1998
Diagnosing infeasibilities in network flow problems.
Math. Program., 1998

1997
Equivalence of the primal and dual simplex algorithms for the maximum flow problem.
Oper. Res. Lett., 1997

A new pivot selection rule for the network simplex algorithm.
Math. Program., 1997

Developing Fitter Genetic Algorithms.
INFORMS J. Comput., 1997

1996
Use of Representative Operation Counts in Computational Testing of Algorithms.
INFORMS J. Comput., 1996

1995
A capacity scaling algorithm for the constrained maximum flow problem.
Networks, 1995

1994
Improved Algorithms for Bipartite Network Flow.
SIAM J. Comput., 1994

1993
Network flows - theory, algorithms and applications.
Prentice Hall, ISBN: 978-0-13-617549-0, 1993

1992
New scaling algorithms for the assignment and minimum mean cycle problems.
Math. Program., 1992

Finding minimum-cost flows by double scaling.
Math. Program., 1992

The Scaling Network Simplex Algorithm.
Oper. Res., 1992

1991
Some Recent Advances in Network Flows.
SIAM Rev., 1991

1990
Faster Algorithms for the Shortest Path Problem
J. ACM, April, 1990

1989
Improved Time Bounds for the Maximum Flow Problem.
SIAM J. Comput., 1989

A Fast and Simple Algorithm for the Maximum Flow Problem.
Oper. Res., 1989

1988
Minimum cost-reliability ratio path problem.
Comput. Oper. Res., 1988


  Loading...