Santosh N. Kabadi

According to our database, Santosh N. Kabadi authored at least 40 papers between 1982 and 2017.

Collaborative distances:

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

2017

A characterization of Linearizable instances of the Quadratic Traveling Salesman Problem.

Abraham P. Punnen, Brad D. Woods, Santosh N. Kabadi

CoRR, 2017

2013

A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems.

Abraham P. Punnen, Santosh N. Kabadi

Discret. Optim., 2013

Spanning cactus of a graph: Existence, extension, optimization, and approximation.

Santosh N. Kabadi, Abraham P. Punnen

Discret. Appl. Math., 2013

2011

An <i>O</i>(<i>n</i>⁴) Algorithm for the QAP Linearization Problem.

Santosh N. Kabadi, Abraham P. Punnen

Math. Oper. Res., 2011

The minimum spanning tree problem with conflict constraints and its variations.

Ruonan Zhang, Santosh N. Kabadi, Abraham P. Punnen

Discret. Optim., 2011

Trioid: A generalization of matroid and the associated polytope.

Santosh N. Kabadi, Abraham P. Punnen

Algorithmic Oper. Res., 2011

2009

2-Commodity Integer Network Synthesis Problem.

Santosh N. Kabadi, R. Chandrasekaran, K. P. K. Nair

Algorithmic Oper. Res., 2009

2008

Integer Exact Network Synthesis Problem.

Santosh N. Kabadi, J. Yan, Donglei Du, K. P. K. Nair

SIAM J. Discret. Math., 2008

A strongly polynomial simplex method for the linear fractional assignment problem.

Santosh N. Kabadi, Abraham P. Punnen

Oper. Res. Lett., 2008

VLSN search algorithms for partitioning problems using matching neighbourhoods.

Temel Öncan, Santosh N. Kabadi, K. P. K. Nair, Abraham P. Punnen

J. Oper. Res. Soc., 2008

Integer version of the multipath flow network synthesis problem.

Santosh N. Kabadi, Ramaswamy Chandrasekaran, K. P. K. Nair, Yash P. Aneja

Discret. Appl. Math., 2008

2007

Flows over edge-disjoint mixed multipaths and applications.

Yash P. Aneja, Ramaswamy Chandrasekaran, Santosh N. Kabadi, K. P. K. Nair

Discret. Appl. Math., 2007

On-line Network Synthesis.

Santosh N. Kabadi, Donglei Du

Algorithmic Oper. Res., 2007

Some Necessary Conditions and a General Suffciency Condition for the Validity of A Gilmore-Gomory Type Patching Scheme for the Traveling.

Md. Fazle Baki, Santosh N. Kabadi

Algorithmic Oper. Res., 2007

2006

On cost matrices with two and three distinct values of Hamiltonian paths and cycles.

Santosh N. Kabadi, Abraham P. Punnen

SIAM J. Discret. Math., 2006

An improved algorithm for decomposing arc flows into multipath flows.

Donglei Du, Santosh N. Kabadi

Oper. Res. Lett., 2006

2005

Delta-matroid and jump system.

Santosh N. Kabadi, R. Sridhar

Adv. Decis. Sci., 2005

Fuzzy disk for covering fuzzy points.

Lushu Li, Santosh N. Kabadi, K. P. K. Nair

Eur. J. Oper. Res., 2005

Multiroute flows: Cut-trees and realizability.

Santosh N. Kabadi, Ramaswamy Chandrasekaran, K. P. K. Nair

Discret. Optim., 2005

2004

Multi-terminal multipath flows: synthesis.

R. Chandrasekaran, Kunhiraman Nair, Yash P. Aneja, Santosh N. Kabadi

Discret. Appl. Math., 2004

2003

Weighted graphs with all Hamiltonian cycles of the same length.

Santosh N. Kabadi, Abraham P. Punnen

Discret. Math., 2003

TSP Heuristics: Domination Analysis and Complexity.

Abraham P. Punnen, François Margot, Santosh N. Kabadi

Algorithmica, 2003

2002

Fuzzy models for single-period inventory problem.

Lushu Li, Santosh N. Kabadi, Kunhiraman Nair

Fuzzy Sets Syst., 2002

Fuzzy versions of the covering circle problem.

Lushu Li, Santosh N. Kabadi, K. P. K. Nair

Eur. J. Oper. Res., 2002

Domination analysis of some heuristics for the traveling salesman problem.

Abraham P. Punnen, Santosh N. Kabadi

Discret. Appl. Math., 2002

New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization.

Santosh N. Kabadi

Discret. Appl. Math., 2002

2001

Generalisations of the Gilmore-Gomory Traveling Salesman Problem and the Gilmore-Gomory Scheme: a Survey.

Santosh N. Kabadi

IGTR, 2001

Equivalence of epsilon-Approximate Separation and Optimization in Fixed Dimensions.

Santosh N. Kabadi, Yash P. Aneja

Algorithmica, 2001

1999

Gilmore-Gomory type traveling salesman problems.

Santosh N. Kabadi, Md. Fazle Baki

Comput. Oper. Res., 1999

Pyramidal traveling salesman problem.

Md. Fazle Baki, Santosh N. Kabadi

Comput. Oper. Res., 1999

1998

Integer Solution for Linear Complementarity Problem.

R. Chandrasekaran, Santosh N. Kabadi, R. Sridhar

Math. Oper. Res., 1998

A generalization of the convex-hull-and-line traveling salesman problem.

Md. Fazle Baki, Santosh N. Kabadi

Adv. Decis. Sci., 1998

A Linear Time Algorithm for the Bottleneck Traveling Salesman Problem on a Halin Graph.

Jeffrey Mark Phillips, Abraham P. Punnen, Santosh N. Kabadi

Inf. Process. Lett., 1998

1997

An Efficient, Strongly Polynomial, epsilon-Approximation Schemes.

Santosh N. Kabadi, Yash P. Aneja

Inf. Process. Lett., 1997

1996

ε-Approximation minimization of convex functions in fixed dimension.

Santosh N. Kabadi, Y. P. Aneia

Oper. Res. Lett., 1996

1990

On totally dual integral systems.

Santosh N. Kabadi, Ramaswamy Chandrasekaran

Discret. Appl. Math., 1990

Solvable Classes of Generalized Traveling Salesman Polytope.

Santosh N. Kabadi, Ramaswamy Chandrasekaran

Proceedings of the Polyhedral Combinatorics, 1990

1988

Pseudomatroids.

R. Chandrasekaran, Santosh N. Kabadi

Discret. Math., 1988

1987

Some NP-complete problems in quadratic and nonlinear programming.

Katta G. Murty, Santosh N. Kabadi

Math. Program., 1987

1982

Some NP-complete problems in linear programming.

R. Chandrasekaran, Santosh N. Kabadi, Katta G. Murty

Oper. Res. Lett., 1982