Ahuja Ravindra K.

Ravindra K. Ahuja

Information about the author Ravindra K. Ahuja will soon be added to the site.
Found 32 papers in total
A new linear programming approach to radiation therapy treatment planning problems
A new linear programming approach to radiation therapy treatment planning problems
2006
We consider the problem of radiation therapy treatment planning for cancer patients....
Solving real-life locomotive-scheduling problems
Solving real-life locomotive-scheduling problems
2005
In the locomotive-scheduling problem (or the locomotive-assignment problem) we must...
Very large-scale neighborhood search for the K-constraint multiple knapsack problem
Very large-scale neighborhood search for the K-constraint multiple knapsack problem
2005
The K -constraint Multiple Knapsack Problem (K-MKP) is a generalization of the...
A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem
A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem
2004
We consider a convex, or nonlinear, separable minimization problem with constraints...
A neighborhood search algorithm for the combined through and fleet assignment model with time windows
A neighborhood search algorithm for the combined through and fleet assignment model with time windows
2004
The fleet assignment model (FAM) for an airline assigns fleet types to a set of flight...
A network flow algorithm to minimize beam-on time for unconstrained multileaf collimator problems in cancer radiation therapy
A network flow algorithm to minimize beam-on time for unconstrained multileaf collimator problems in cancer radiation therapy
2005
In this article, we study the modulation of intensity matrices arising in cancer...
Solving the convex cost integer dual network flow
Solving the convex cost integer dual network flow
2003
In this paper, we consider an integer convex optimization problem where the objective...
A composite very large-scale neighbourhood structure for the capacitated minimum spanning tree problem
A composite very large-scale neighbourhood structure for the capacitated minimum spanning tree problem
2003
The capacitated minimum spanning tree (CMST) problem is to find a minimum cost...
Minimum time and minimum cost-path problems in street networks with periodic traffic lights
Minimum time and minimum cost-path problems in street networks with periodic traffic lights
2002
This paper investigates minimum time and minimum cost path problems in street networks...
Minimum time and minimum cost-path problems in street networks with periodic traffic lights
Minimum time and minimum cost-path problems in street networks with periodic traffic lights
2002
This paper investigates minimum time and minimum cost path problems in street networks...
Dynamic shortest paths minimizing travel times and costs
Dynamic shortest paths minimizing travel times and costs
2003
In this paper, we study dynamic shortest path problems that determine a shortest path...
Combinatorial algorithms for inverse network flow problems
Combinatorial algorithms for inverse network flow problems
2002
An inverse optimization problem is defined as follows: Let S denote the set of...
New polynomial-time cycle-canceling algorithms for minimum-cost flows
New polynomial-time cycle-canceling algorithms for minimum-cost flows
2000
The cycle-canceling algorithm is one of the earliest algorithms to solve the...
Inverse optimization
Inverse optimization
2001
In this paper, we study inverse optimization problems defined as follows. Let S denote...
A fast scaling algorithm for minimizing separable convex functions subject to chain constraints
A fast scaling algorithm for minimizing separable convex functions subject to chain constraints
2001
We consider the problem of minimizing Σ j∈N C j ( x j ), subject to the...
Very large-scale neighborhood search
Very large-scale neighborhood search
2000
Neighborhood search algorithms are often the most effective approaches available for...
A greedy genetic algorithm for the quadratic assignment problem
A greedy genetic algorithm for the quadratic assignment problem
2000
The Quadratic Assignment Problem (QAP) is one of the classical combinatorial...
Solving inverse spanning tree problems through network flow techniques
Solving inverse spanning tree problems through network flow techniques
1999
Given a solution x * and an a priori estimated cost vector c , the inverse...
Algorithms for the simple equal flow problem
Algorithms for the simple equal flow problem
1999
The minimum cost flow problem is to determine a least cost shipment of a commodity...
Diagnosing infeasibilities in network flow problems
Diagnosing infeasibilities in network flow problems
1998
We consider the problem of finding a feasible flow in a directed network G = ( N,A )...
The balanced linear programming problem
The balanced linear programming problem
1997
The Balanced Linear Programming Problem (BLPP) arises in situations which required...
Computational investigations of maximum flow algorithms
Computational investigations of maximum flow algorithms
1997
The maximum flow algorithm is distinguished by the long line of successive...
A new pivot selection rule for the network simplex algorithm
A new pivot selection rule for the network simplex algorithm
1997
We present a new network simplex pivot selection rule, which we call the minimum ratio...
Use of representative operation counts in computational testing of algorithms
Use of representative operation counts in computational testing of algorithms
1996
In the mathematical programming literature, researchers have conducted a large number...
Papers per page: