Santosh N. Kabadi

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

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
A characterization of Linearizable instances of the Quadratic Traveling Salesman Problem.
CoRR, 2017

2013
A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems.
Discret. Optim., 2013

Spanning cactus of a graph: Existence, extension, optimization, and approximation.
Discret. Appl. Math., 2013

2011
An <i>O</i>(<i>n</i><sup>4</sup>) Algorithm for the QAP Linearization Problem.
Math. Oper. Res., 2011

The minimum spanning tree problem with conflict constraints and its variations.
Discret. Optim., 2011

Trioid: A generalization of matroid and the associated polytope.
Algorithmic Oper. Res., 2011

2009
2-Commodity Integer Network Synthesis Problem.
Algorithmic Oper. Res., 2009

2008
Integer Exact Network Synthesis Problem.
SIAM J. Discret. Math., 2008

A strongly polynomial simplex method for the linear fractional assignment problem.
Oper. Res. Lett., 2008

VLSN search algorithms for partitioning problems using matching neighbourhoods.
J. Oper. Res. Soc., 2008

Integer version of the multipath flow network synthesis problem.
Discret. Appl. Math., 2008

2007
Flows over edge-disjoint mixed multipaths and applications.
Discret. Appl. Math., 2007

On-line Network Synthesis.
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.
Algorithmic Oper. Res., 2007

2006
On cost matrices with two and three distinct values of Hamiltonian paths and cycles.
SIAM J. Discret. Math., 2006

An improved algorithm for decomposing arc flows into multipath flows.
Oper. Res. Lett., 2006

2005
Delta-matroid and jump system.
Adv. Decis. Sci., 2005

Fuzzy disk for covering fuzzy points.
Eur. J. Oper. Res., 2005

Multiroute flows: Cut-trees and realizability.
Discret. Optim., 2005

2004
Multi-terminal multipath flows: synthesis.
Discret. Appl. Math., 2004

2003
Weighted graphs with all Hamiltonian cycles of the same length.
Discret. Math., 2003

TSP Heuristics: Domination Analysis and Complexity.
Algorithmica, 2003

2002
Fuzzy models for single-period inventory problem.
Fuzzy Sets Syst., 2002

Fuzzy versions of the covering circle problem.
Eur. J. Oper. Res., 2002

Domination analysis of some heuristics for the traveling salesman problem.
Discret. Appl. Math., 2002

New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization.
Discret. Appl. Math., 2002

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

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

1999
Gilmore-Gomory type traveling salesman problems.
Comput. Oper. Res., 1999

Pyramidal traveling salesman problem.
Comput. Oper. Res., 1999

1998
Integer Solution for Linear Complementarity Problem.
Math. Oper. Res., 1998

A generalization of the convex-hull-and-line traveling salesman problem.
Adv. Decis. Sci., 1998

A Linear Time Algorithm for the Bottleneck Traveling Salesman Problem on a Halin Graph.
Inf. Process. Lett., 1998

1997
An Efficient, Strongly Polynomial, epsilon-Approximation Schemes.
Inf. Process. Lett., 1997

1996
ε-Approximation minimization of convex functions in fixed dimension.
Oper. Res. Lett., 1996

1990
On totally dual integral systems.
Discret. Appl. Math., 1990

Solvable Classes of Generalized Traveling Salesman Polytope.
Proceedings of the Polyhedral Combinatorics, 1990

1988
Pseudomatroids.
Discret. Math., 1988

1987
Some NP-complete problems in quadratic and nonlinear programming.
Math. Program., 1987

1982
Some NP-complete problems in linear programming.
Oper. Res. Lett., 1982


  Loading...