Santosh N. Kabadi

Publication Activity (10 Years)

Years Active: 1982-2017
Publications (10 Years): 1

Top Topics

Related Problems

Subsurface Scattering

Quadratic Assignment Problem

Top Venues

Discret. Optim.

Discret. Appl. Math.

Publications

Abraham P. Punnen, Brad D. Woods, Santosh N. Kabadi
A characterization of Linearizable instances of the Quadratic Traveling Salesman Problem. CoRR (2017)
Santosh N. Kabadi, Abraham P. Punnen
Spanning cactus of a graph: Existence, extension, optimization, and approximation. Discret. Appl. Math. 161 (1-2) (2013)
Abraham P. Punnen, Santosh N. Kabadi
A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems. Discret. Optim. 10 (3) (2013)
Santosh N. Kabadi, Abraham P. Punnen
) Algorithm for the QAP Linearization Problem. Math. Oper. Res. 36 (4) (2011)
Santosh N. Kabadi, Abraham P. Punnen
Trioid: A generalization of matroid and the associated polytope. Algorithmic Oper. Res. 6 (1) (2011)
Ruonan Zhang, Santosh N. Kabadi, Abraham P. Punnen
The minimum spanning tree problem with conflict constraints and its variations. Discret. Optim. 8 (2) (2011)
Santosh N. Kabadi, R. Chandrasekaran, K. P. K. Nair
2-Commodity Integer Network Synthesis Problem. Algorithmic Oper. Res. 4 (2) (2009)
Santosh N. Kabadi, Ramaswamy Chandrasekaran, K. P. K. Nair, Yash P. Aneja
Integer version of the multipath flow network synthesis problem. Discret. Appl. Math. 156 (18) (2008)
Santosh N. Kabadi, Abraham P. Punnen
A strongly polynomial simplex method for the linear fractional assignment problem. Oper. Res. Lett. 36 (4) (2008)
Temel Öncan, Santosh N. Kabadi, K. P. K. Nair, Abraham P. Punnen
VLSN search algorithms for partitioning problems using matching neighbourhoods. J. Oper. Res. Soc. 59 (3) (2008)
Santosh N. Kabadi, J. Yan, Donglei Du, K. P. K. Nair
Integer Exact Network Synthesis Problem. SIAM J. Discret. Math. 23 (1) (2008)
Md. Fazle Baki, Santosh N. Kabadi
Some Necessary Conditions and a General Suffciency Condition for the Validity of A Gilmore-Gomory Type Patching Scheme for the Traveling. Algorithmic Oper. Res. 2 (1) (2007)
Yash P. Aneja, Ramaswamy Chandrasekaran, Santosh N. Kabadi, K. P. K. Nair
Flows over edge-disjoint mixed multipaths and applications. Discret. Appl. Math. 155 (15) (2007)
Santosh N. Kabadi, Donglei Du
On-line Network Synthesis. Algorithmic Oper. Res. 2 (1) (2007)
Donglei Du, Santosh N. Kabadi
An improved algorithm for decomposing arc flows into multipath flows. Oper. Res. Lett. 34 (1) (2006)
Santosh N. Kabadi, Abraham P. Punnen
On cost matrices with two and three distinct values of Hamiltonian paths and cycles. SIAM J. Discret. Math. 20 (4) (2006)
Lushu Li, Santosh N. Kabadi, K. P. K. Nair
Fuzzy disk for covering fuzzy points. Eur. J. Oper. Res. 160 (2) (2005)
Santosh N. Kabadi, R. Sridhar
Delta-matroid and jump system. Adv. Decis. Sci. 9 (2) (2005)
Santosh N. Kabadi, Ramaswamy Chandrasekaran, K. P. K. Nair
Multiroute flows: Cut-trees and realizability. Discret. Optim. 2 (3) (2005)
R. Chandrasekaran, Kunhiraman Nair, Yash P. Aneja, Santosh N. Kabadi
Multi-terminal multipath flows: synthesis. Discret. Appl. Math. 143 (1-3) (2004)
Santosh N. Kabadi, Abraham P. Punnen
Weighted graphs with all Hamiltonian cycles of the same length. Discret. Math. 271 (1-3) (2003)
Abraham P. Punnen, François Margot, Santosh N. Kabadi
TSP Heuristics: Domination Analysis and Complexity. Algorithmica 35 (2) (2003)
Lushu Li, Santosh N. Kabadi, K. P. K. Nair
Fuzzy versions of the covering circle problem. Eur. J. Oper. Res. 137 (1) (2002)
Abraham P. Punnen, Santosh N. Kabadi
Domination analysis of some heuristics for the traveling salesman problem. Discret. Appl. Math. 119 (1-2) (2002)
Santosh N. Kabadi
New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization. Discret. Appl. Math. 119 (1-2) (2002)
Lushu Li, Santosh N. Kabadi, Kunhiraman Nair
Fuzzy models for single-period inventory problem. Fuzzy Sets Syst. 132 (3) (2002)
Santosh N. Kabadi
Generalisations of the Gilmore-Gomory Traveling Salesman Problem and the Gilmore-Gomory Scheme: a Survey. IGTR 3 (2-3) (2001)
Santosh N. Kabadi, Yash P. Aneja
Equivalence of epsilon-Approximate Separation and Optimization in Fixed Dimensions. Algorithmica 29 (4) (2001)
Santosh N. Kabadi, Md. Fazle Baki
Gilmore-Gomory type traveling salesman problems. Comput. Oper. Res. 26 (4) (1999)
Md. Fazle Baki, Santosh N. Kabadi
Pyramidal traveling salesman problem. Comput. Oper. Res. 26 (4) (1999)
R. Chandrasekaran, Santosh N. Kabadi, R. Sridhar
Integer Solution for Linear Complementarity Problem. Math. Oper. Res. 23 (2) (1998)
Md. Fazle Baki, Santosh N. Kabadi
A generalization of the convex-hull-and-line traveling salesman problem. Adv. Decis. Sci. 2 (2) (1998)
Jeffrey Mark Phillips, Abraham P. Punnen, Santosh N. Kabadi
A Linear Time Algorithm for the Bottleneck Traveling Salesman Problem on a Halin Graph. Inf. Process. Lett. 67 (2) (1998)
Santosh N. Kabadi, Yash P. Aneja
An Efficient, Strongly Polynomial, epsilon-Approximation Schemes. Inf. Process. Lett. 64 (4) (1997)
Santosh N. Kabadi, Y. P. Aneia
ε-Approximation minimization of convex functions in fixed dimension. Oper. Res. Lett. 18 (4) (1996)
Santosh N. Kabadi, Ramaswamy Chandrasekaran
On totally dual integral systems. Discret. Appl. Math. 26 (1) (1990)
Santosh N. Kabadi, Ramaswamy Chandrasekaran
Solvable Classes of Generalized Traveling Salesman Polytope. Polyhedral Combinatorics (1990)
R. Chandrasekaran, Santosh N. Kabadi
Pseudomatroids. Discret. Math. 71 (3) (1988)
Katta G. Murty, Santosh N. Kabadi
Some NP-complete problems in quadratic and nonlinear programming. Math. Program. 39 (2) (1987)
R. Chandrasekaran, Santosh N. Kabadi, Katta G. Murty
Some NP-complete problems in linear programming. Oper. Res. Lett. 1 (3) (1982)