P. T. Sokkalingam

According to our database, P. T. Sokkalingam authored at least 6 papers between 1997 and 2005.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2005

A combinatorial arc tolerance analysis for network flow problems.

P. T. Sokkalingam, Prabha Sharma

Adv. Decis. Sci., 2005

2002

A network simplex algorithm with O(<i>n</i>) consecutive degenerate pivots.

Ravindra K. Ahuja, James B. Orlin, Prabha Sharma, P. T. Sokkalingam

Oper. Res. Lett., 2002

2000

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

P. T. Sokkalingam, Ravindra K. Ahuja, James B. Orlin

Networks, 2000

1999

Solving Inverse Spanning Tree Problems Through Network Flow Techniques.

P. T. Sokkalingam, Ravindra K. Ahuja, James B. Orlin

Oper. Res., 1999

1998

Lexicographic bottleneck combinatorial problems.

P. T. Sokkalingam, Yash P. Aneja

Oper. Res. Lett., 1998

1997

A new pivot selection rule for the network simplex algorithm.

P. T. Sokkalingam, Prabha Sharma, Ravindra K. Ahuja

Math. Program., 1997