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...
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 combinatorial arc tolerance analysis for network flow problems (2005)
P. T. Sokkalingam, Prabha Sharma
For the separable convex cost flow problem, we consider the problem of determining tolerance set for each arc cost function. For a given optimal flow x, a valid perturbation of cij(x) is a convex...
A combinatorial arc tolerance analysis for network flow problems (2005)
P. T. Sokkalingam, Prabha Sharma
For the separable convex cost flow problem, we consider the problem of determining tolerance set for each arc cost function. For a given optimal flow x, a valid perturbation of cij(x) is a convex...
A combinatorial arc tolerance analysis for network flow problems (2005)
P. T. Sokkalingam, Prabha Sharma
For the separable convex cost flow problem, we consider the problem of determining tolerance set for each arc cost function. For a given optimal flow x, a valid perturbation of cij(x) is a convex...
A COMBINATORIAL ARC TOLERANCE ANALYSIS FOR NETWORK FLOW PROBLEMS (2003)
P. T. Sokkalingam, Prabha Sharma
For the separable convex cost flow problem, we consider the problem of determining tolerance set for each arc cost function. For a given optimal flow x, avalidperturbation of cij(x) is a convex...
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...
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...
Inverse spanning tree problems : formulations and algorithms (1996)
Sokkalingam, P. T., Ahuja, Ravindra K., Orlin, James B.
Cover title.
Inverse spanning tree problems : formulations and algorithms (1996)
Sokkalingam, P. T., Ahuja, Ravindra K., Orlin, James B.
Cover title.
New polynomial-time cycle-canceling algorithms for minimum cost flows
Sokkalingam, P. T., Ahuja, Ravindra K., 1956-, Orlin, James B., 1953-
HD28 .M414 no.3914-96,