2. Abhijit Pol, Chris Jermaine: Maintaining Very Large Random Samples With The (2009)
Abhijit Pol, Abhijit A. Pol, Ravindra K. Ahuja, Developing Web-enabled, Serdar Kirli, Abhijit A. Pol, ...
.NET for Engineers and Scientists.
Solving Linear Cost Dynamic Lot Sizing Problems in O(n log n) Time (2008)
Ravindra K. Ahuja, Dorit S. Hochbaum
In this paper, we study capacitated dynamic lot sizing problems with or without backorders, under the assumption that production costs are linear, that is, there are no set up costs. These two...
Computer Algorithms. Addison-Wesley, 1974. (2008)
Milton Abramowitz, Irene A. Stegun, Leonard M. Adleman, Carl Pomerance, ...
numbers from composite numbers. Annals of Mathematics, 117:173–206, 1983. [4] Alok Aggarwal and Jeffrey Scott Vitter. The input/output complexity of sorting and related problems. Communications of...
References Constrained Model–Based Clustering (2008)
Gunter Ritter, Hans Achatz, Peter Kleinschmidt, Bernd Sturmfels, Ravindra K. Ahuja, ...
algorithms for bipartite network flows. SIAM J. Computing, 23:906–933, 1994. [3] María Teresa Gallegos and Gunter Ritter. A robust method for cluster analysis. Annals
Algorithms New Polynomial-Time Cycle-Canceling Algorithms for Minimum Cost Flows (2008)
P. T. Sokkalingam, Ravindra K. Ahuja, James B. Orlin, P. T. Sokkalingam, Ravindra K. Ahuja, James B. Orlin, ...
The cycle-canceling algorithm is one of the earliest algorithms to solve the minimum cost flow problem. This algorithm maintains a feasible solution x in the network G and proceeds by augmenting...
Errata for Network Flows: Theory, Algorithms, and Applications. By (2008)
Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin
Errors listed in blue were corrected in the 4 th printing of the textbook. Errors listed in boldface black still remain as errors. I thank all of you who have sent me corrections over the years. If...
SOLVING MULTI-CRITERIA THROUGH-FLEET ASSIGNMENT MODELS (2008)
Ravindra K. Ahuja, Jian Liu, Jon Goodstein, Amit Mukherjee, James B. Orlin, Dushyant Sharma
Abstract The airline industry has been a pioneer in using operations research techniques to solve complex business problems related to the schedule planning of the airline. Given a flight schedule,...
Errata for Network Flows: Theory, Algorithms, and Applications. By (2007)
Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin
Errors listed in blue were corrected in the 4 th printing of the textbook. Errors listed in boldface black still remain as errors. I thank all of you who have sent me corrections over the years. If...
A Network Simplex Algorithm with O(n) Consecutive Degenerate Pivots (2007)
Ravindra K. Ahuja, Ravindra K. Ahuja, James B. Orlin, James B. Orlin, Prabha Sharma, Prabha Sharma, ...
In this paper, we suggest a new pivot rule for the primal simplex algorithm for the minimum cost flow problem, known as the network simplex algorithm. Due to degeneracy, cycling may occur in the...
INVERSE SPANNING TREE PROBLEMS: FORMULATIONS AND ALGORITHMS (2007)
P. T. Sokkalingam, P. T. Sokkalingam, Ravindra K. Ahuja, Ravindra K. Ahuja, James B. Orlin, James B. Orlin
Given a solution x * and an a priori estimated cost vector c, the inverse optimization problem is to identify another cost vector d so that x * is optimal with respect to the cost vector d and the...
A Capacity Scaling Algorithm for the Constrained Maximum Flow Problem (2007)
Ahuja, Ravindra K., Kanpur, I. I., Orlin, James B.
The constrained maximum flow problem is to send the maximum possible flow from a source node 5 to a sink node tin a directed network subject to a budget constraint that the cost of flow is no more...
Ahuja, Ravindra K., Liebchen, Christian, Mesa, Juan A.
Proceedings of the 7thWorkshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, held on No- vember 15 and November 16, 2007 in Sevilla, Spain.
Ahuja, Ravindra K., Liebchen, Christian, Mesa, Juan A.
Proceedings of the 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, held on November 15 and November 16, 2007 in Sevilla, Spain.
17. A Simulation/Optimization Framework for Locomotive Planning (2007)
Nahapetyan, Artyom, Ahuja, Ravindra K., Sargut, F. Zeynep, John, Andy, Somani, Kamalesh
In this paper, we give an overview of the Locomotive Simulater/Optimizer (LSO) decision support system developed by us for railroads. This software is designed to imitate locomotive movement across a...
www.InnovativeScheduling.com (2006)
Ravindra K. Ahuja, Mohammad Jaradat, Krishna C. Jha, Arvind Kumar, Pooja Dewan
Math Clinic Annotated Bibliography References Class Math 4779/5779 (2005)
Ravindra K. Ahuja, Thomas L. Magnanti
This is a report on how mixed integer programming works. It starts by showing the form of a mixed integer program with n variables and m constraints. They explain the branch and bound method which is...
Ravindra K. Ahuja, Horst W. Hamacher
In this article, we study the modulation of intensity matrices arising in cancer radiation therapy using multileaf collimators. This problem can be formulated by decomposing a given m � n integer...
Exact and Heuristic Methods for the Weapon Target Assignment Problem (2004)
Ahuja, Ravindra K., Kumar, Arvind, Jha, Krishna, Orlin, James B.
The Weapon Target Assignment (WTA) problem is a fundamental problem arising in defense-related applications of operations research. This problem consists of optimally assigning n weapons to m targets...
Exact and Heuristic Methods for the Weapon Target Assignment Problem (2004)
Ahuja, Ravindra K., Kumar, Arvind, Jha, Krishna, Orlin, James B.
The Weapon Target Assignment (WTA) problem is a fundamental problem arising in defense-related applications of operations research. This problem consists of optimally assigning n weapons to m targets...
Dynamic shortest paths minimizing travel times and costs (2003)
Ravindra K. Ahuja, James B. Orlin, Stefano Pallottino, Maria G. Scutellà
Dynamic Shortest Paths Minimizing Travel Times and Costs In this paper, we study dynamic shortest path problems, which is to determine a shortest path from a specified source node to every other node...
Dynamic shortest paths minimizing travel times and costs (2003)
Ravindra K. Ahuja, James B. Orlin, Stefano Pallottino, Maria G. Scutellà
Dynamic Shortest Paths Minimizing Travel Times and Costs In this paper, we study dynamic shortest path problems that determine a shortest path from a specified source node to every other node in the...
A survey of very large-scale neighborhood search techniques (2002)
Ravindra K. Ahuja, Ravindra K. Ahuja, Krishna C. Jha, Krishna C. Jha, James B. Orlin, James B. Orlin, ...
The Quadratic Assignment Problem (QAP) consists of assigning n facilities to n locations so as to minimize the total weighted cost of interactions between facilities. The QAP arises in many diverse...
Minimum time and minimum cost path problems in street networks with periodic traffic lights (2002)
Ravindra K. Ahuja, James B. Orlin, Stefano Pallottino, Maria Grazia Scutellà
networks with periodic traffic lights
A very large scale neighborhood search algorithm for the quadratic assignment problem (2002)
Ravindra K. Ahuja, Ravindra K. Ahuja, Ozlem Ergun, Ozlem Ergun, James B. Orlin, James B. Orlin, ...
Many optimization problems of practical interest are computationally intractable. Therefore, a practical approach for solving such problems is to employ heuristic (approximation) algorithms that can...
Ravindra K. Ahuja, Ravindra K. Ahuja, James B. Orlin, James B. Orlin
In this paper, we consider the problem of minimizing ∑ j j 1 j NC(x) ∈, subject to the following chain constraints l ≤ x 1 ≤ x 2 ≤ x 3 ≤ … ≤ x n ≤ u, where C j (x j) is a convex...
Ravindra K. Ahuja, Ravindra K. Ahuja, James B. Orlin, James B. Orlin
In this paper, we study inverse optimization problems defined as follows: Let S denote the set of feasible solutions of an optimization problem P, let c be a specified cost vector, and x 0 be a given...
Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem (2000)
Ravindra K. Ahuja, Ravindra K. Ahuja, James B. Orlin, James B. Orlin, Dushyant Sharma, Dushyant Sharma
The capacitated minimum spanning tree (CMST) problem is to find a minimum cost spanning tree with an additional cardinality constraint on the sizes of the subtrees incident to a given root node. The...
New polynomial-time cycle-canceling algorithms for minimum-cost flows,” in Networks (2000)
P. T. Sokkalingam, P. T. Sokkalingam, Ravindra K. Ahuja, Ravindra K. Ahuja, James B. Orlin, James B. Orlin
The cycle-canceling algorithm is one of the earliest algorithms to solve the minimum cost flow problem. This algorithm maintains a feasible solution x in the network G and proceeds by augmenting...
A faster algorithm for the inverse spanning tree problem (2000)
Ravindra K. Ahuja, Ravindra K. Ahuja, James B. Orlin, James B. Orlin
In this paper, we consider the inverse spanning tree problem. Given an undirected graph G 0 = (N 0, A 0) with n nodes, m arcs, an arc cost vector c, and a spanning tree T 0, the inverse spanning tree...
New polynomial-time cycle-canceling algorithms for minimum-cost flows,” in Networks (2000)
P. T. Sokkalingam, P. T. Sokkalingam, Ravindra K. Ahuja, Ravindra K. Ahuja, James B. Orlin, James B. Orlin
The cycle-canceling algorithm is one of the earliest algorithms to solve the minimum cost flow problem. This algorithm maintains a feasible solution x in the network G and proceeds by augmenting...
Solving the convex cost integer dual network flow problem (1999)
Ravindra K. Ahuja, Ravindra K. Ahuja, Dorit S. Hochbaum, Dorit S. Hochbaum, James B. Orlin, James B. Orlin
In this paper, we consider an integer convex optimization problem where the objective function is the sum of separable convex functions (that is, of the form Σ (i,j)∈Q F(w ij ij)+ Σi∈P i i 1 B...
Algorithms for the simple equal flow problem (1999)
Ravindra K. Ahuja, Ravindra K. Ahuja, James B. Orlin, James B. Orlin, Giovanni M. Sechi, Giovanni M. Sechi, ...
The minimum cost flow problem is to determine a least cost shipment of a commodity through a network G = (N, A) in order to satisfy demands at certain nodes from available supplies at other nodes. In...
Faster Algorithms for the Shortest Path Problem, (1998)
Ahuja, Ravindra K., Mehlhorn, Kurt, Orlin, James B., Tarjan, Robert E.
This document investigates efficient implementations of Dijkstra's shortest path algorithm. The authors propose a new data structure, called the redistributive heap, for use in this algorithm. On a...
Finding Minimum-Cost Flows by Double Scaling, (1998)
Ahuja, Ravindra K., Goldberg, Andrew V., Orlin, James B., Tarjan, Robert E.
Several researchers have recently developed new techniques that give fast algorithms for the minimum-cost flow problem. In this paper we combine several of these techniques to yield an algorithm...
Combinatorial algorithms for inverse network flow problems (1998)
Ravindra K. Ahuja, Ravindra K. Ahuja, James B. Orlin, James B. Orlin
Diagnosing infeasibilities in network flow problems (1998)
Charu C. Aggarwal, Charu C. Aggarwal, Ravindra K. Ahuja, Ravindra K. Ahuja, Jianxiu Hao, Jianxiu Hao, ...
We consider the problem of finding a feasible flow in a directed G = (N, A) in which each node i ∈ N has a supply b(i), and each arc (i, j) ∈ A has a zero lower bound on flow and an upper bound u...
Combinatorial algorithms for inverse network flow problems (1998)
Ravindra K. Ahuja, Ravindra K. Ahuja, Ravindra K. Ahuja, James B. Orlin, James B. Orlin, James B. Orlin
An inverse optimization problems is defined as follows: Let S denote the set of feasible solutions of an optimization problem P, let c be a specified cost vector, and xO be a given feasible solution....
Ravindra K. Ahuja, Ravindra K. Ahuja, Ravindra K. Ahuja, James B. Orlin, James B. Orlin, James B. Orlin
In this paper, we consider the bipartite node weighted matching problem on a special class of graphs, called path graphs, and develop a highly efficient algorithm for solving it. This matching...
Linear Programming and General Problem (1998)
Ravindra K. Ahuja, James B. Orlin, Ravindra K. Ahuja, James B. Orlin, Ravindra K. Ahuja, James B. Orlin
In this paper, we study inverse optimization problems defined as follows: Let S denote the set of feasible solutions of an optimization problem P, let c be a specified cost vector, and x 0 be a given...
Computational investigation of maximum flow algorithms (1997)
Ravindra K. Ahuja, Ravindra K. Ahuja, Murali Kodialam, Murali Kodialam, Ajay K. Mishra, Ajay K. Mishra, ...
The maximum flow algorithm is distinguished by the long line of successive contributions researchers have made in obtaining algorithms with incrementally better worst-case complexity. Some, but not...
Use of representative operation counts in computational testing of algorithms (1996)
Ravindra K. Ahuja, Ravindra K. Ahuja, Ravindra K Ahuja, James B. Orlin, James B. Orlin, James B. Orlin, ...
The purpose of mathematical programming is insight, not numbers.
Inverse spanning tree problems : formulations and algorithms (1996)
Sokkalingam, P. T., Ahuja, Ravindra K., Orlin, James B.
Cover title.
Applications of Network Optimization (1995)
Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin, M.R. Reddy
Network optimization has always been a core problem domain in operations research, as well as in computer science, applied mathematics, and many fields of engineering and management. Network...
Applications of Network Optimization (1995)
R. Ahuja, T. L. Magnanti, J. B. Orlin, Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin, ...
I
Improved Algorithms For Bipartite Network Flow (1994)
Ravindra K. Ahuja, James B. Orlin, Clifford Stein, Robert E. Tarjan, Robert E
. In this paper, we study network flow algorithms for bipartite networks. A network G = (V; E) is called bipartite if its vertex set V can be partitioned into two subsets V 1 and V 2 such that all...
Finding Minimum-Cost Flows by Double Scaling (1992)
Ravindra K. Ahuja, Ravindra K. Ahuja, Ravindra K. Ahuja, Andrew V. Goldberg, Andrew V. Goldberg, Andrew V. Goldberg, ...
Several researchers have recently developed new techniques that give fast algorithms for the minimum-cost flow problem. In this paper we combine several of these techniques to yield an algorithm...
Faster Algorithms for the Shortest Path Problem (1990)
Ravindra K. Ahuja, Kurt Mehlhorn, James B. Orlin, Robert E. Tarjan
Abstract. Efficient implementations of Dijkstra’s shortest path algorithm are investigated. A new data structure, called the radix heap, is proposed for use in this algorithm. On a network with n...
Faster algorithms for the shortest path problem (1990)
Ahuja, Ravindra K., Mehlhorn, Kurt, Orlin, James B., Tarjan, Robert E.
Improved Time Bounds for the Maximum Flow Problem (1988)
X A Er, X Xaf X, Ravindra K. Ahuja, James B. Orlin, Robert E. Tarjan, Ravindra K. Ahuja, ...
tT~~~~~~~~ ~-.- it _.r)-1.--::- I:I
Faster Algorithms for the Shortest Path Problem (1988)
Ahuja, Ravindra K., Mehlhorn, Kurt, Orlin, James B., Tarjan, Robert E.
Faster Algorithms for the Shortest Path Problem (1988)
Ahuja, Ravindra K., Mehlhorn, Kurt, Orlin, James B., Tarjan, Robert E.
A fast and simple algorithm for the maximum flow problem (1988)
Ahuja, Ravindra K., Orlin, James B.
"June 1987, revised: March 1988."
Improved time bounds for the maximum flow problem (1988)
Ahuja, Ravindra K., Orlin, James B., Tarjan, Robert E.
"December 1987, revised June 1988."
Ahuja, Ravindra K., Orlin, James B.
"November 1988."
Ahuja, Ravindra K., Magnanti, Thomas L., Orlin, James B.
"August 1988. Revised: December, 1988."
Maximum Flow and Parametric Maximum Flow Problems (1908)
J. B. Orlin, R. K. Ahuja, James B. Orlin, Ravindra K. Ahuja
for
Computational investigations of maximum flow algorithms
Ahuja, Ravindra K., Kodialam, Murali, Mishra, Ajay K., Orlin, James B.
Exact and Heuristic Methods for the Weapon Target Assignment Problem
Ahuja, Ravindra K., Kumar, Arvind, Jha, Krishna, Orlin, James B.
The Weapon Target Assignment (WTA) problem is a fundamental problem arising in defense-related applications of operations research. This problem consists of optimally assigning n weapons to m targets...
Real-life locomotive planning: New formulations and computational results
Vaidyanathan, Balachandran, Ahuja, Ravindra K., Liu, Jian, Shughart, Larry A.
In this paper, we develop new formulations for the locomotive planning problem (LPP) which is one of the most important railroad optimization problems. The objective of the LPP is to assign a consist...