Sokkalingam P.T.

P.T. Sokkalingam

Information about the author P.T. Sokkalingam will soon be added to the site.
Found 6 papers in total
The minimal feedback arc set problem
The minimal feedback arc set problem
2004
Given a directed network G(N;A), the minimum feedback arc set problem is to find an...
A combinatorial arc tolerance analysis for network flow problems
A combinatorial arc tolerance analysis for network flow problems
2005
For the separable convex cost flow problem, we consider the problem of determining...
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...
Lexicographic bottleneck combinatorial problems
Lexicographic bottleneck combinatorial problems
1998
We study combinatorial problems (CP) with lex-bottleneck objective function, where in...
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...
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...
Papers per page: