default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSantosh N. Kabadi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[i1]Abraham P. Punnen, Brad D. Woods, Santosh N. Kabadi:
A characterization of Linearizable instances of the Quadratic Traveling Salesman Problem. CoRR abs/1708.07217 (2017)- 2013
- [j38]Santosh N. Kabadi, Abraham P. Punnen:
Spanning cactus of a graph: Existence, extension, optimization, and approximation. Discret. Appl. Math. 161(1-2): 167-175 (2013) - [j37]Abraham P. Punnen, Santosh N. Kabadi:
A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems. Discret. Optim. 10(3): 200-209 (2013) - 2011
- [j36]Santosh N. Kabadi, Abraham P. Punnen:
Trioid: A generalization of matroid and the associated polytope. Algorithmic Oper. Res. 6(1): 29-39 (2011) - [j35]Ruonan Zhang, Santosh N. Kabadi, Abraham P. Punnen:
The minimum spanning tree problem with conflict constraints and its variations. Discret. Optim. 8(2): 191-205 (2011) - [j34]Santosh N. Kabadi, Abraham P. Punnen:
An O(n4) Algorithm for the QAP Linearization Problem. Math. Oper. Res. 36(4): 754-761 (2011)
2000 – 2009
- 2009
- [j33]Santosh N. Kabadi, R. Chandrasekaran, K. P. K. Nair:
2-Commodity Integer Network Synthesis Problem. Algorithmic Oper. Res. 4(2): 117-132 (2009) - 2008
- [j32]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): 3376-3399 (2008) - [j31]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): 388-398 (2008) - [j30]Santosh N. Kabadi, Abraham P. Punnen:
A strongly polynomial simplex method for the linear fractional assignment problem. Oper. Res. Lett. 36(4): 402-407 (2008) - [j29]Santosh N. Kabadi, J. Yan, Donglei Du
, K. P. K. Nair:
Integer Exact Network Synthesis Problem. SIAM J. Discret. Math. 23(1): 136-154 (2008) - 2007
- [j28]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) - [j27]Santosh N. Kabadi, Donglei Du:
On-line Network Synthesis. Algorithmic Oper. Res. 2(1) (2007) - [j26]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): 1979-2000 (2007) - 2006
- [j25]Donglei Du, Santosh N. Kabadi:
An improved algorithm for decomposing arc flows into multipath flows. Oper. Res. Lett. 34(1): 53-57 (2006) - [j24]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): 977-998 (2006) - 2005
- [j23]Santosh N. Kabadi, Ramaswamy Chandrasekaran, K. P. K. Nair:
Multiroute flows: Cut-trees and realizability. Discret. Optim. 2(3): 229-240 (2005) - [j22]Lushu Li, Santosh N. Kabadi, K. P. K. Nair:
Fuzzy disk for covering fuzzy points. Eur. J. Oper. Res. 160(2): 560-573 (2005) - [j21]Santosh N. Kabadi, R. Sridhar:
Delta-matroid and jump system. Adv. Decis. Sci. 9(2): 95-106 (2005) - 2004
- [j20]R. Chandrasekaran, Kunhiraman Nair, Yash P. Aneja, Santosh N. Kabadi:
Multi-terminal multipath flows: synthesis. Discret. Appl. Math. 143(1-3): 182-193 (2004) - 2003
- [j19]Abraham P. Punnen, François Margot, Santosh N. Kabadi:
TSP Heuristics: Domination Analysis and Complexity. Algorithmica 35(2): 111-127 (2003) - [j18]Santosh N. Kabadi, Abraham P. Punnen:
Weighted graphs with all Hamiltonian cycles of the same length. Discret. Math. 271(1-3): 129-139 (2003) - 2002
- [j17]Abraham P. Punnen, Santosh N. Kabadi:
Domination analysis of some heuristics for the traveling salesman problem. Discret. Appl. Math. 119(1-2): 117-128 (2002) - [j16]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): 149-167 (2002) - [j15]Lushu Li, Santosh N. Kabadi, K. P. K. Nair:
Fuzzy versions of the covering circle problem. Eur. J. Oper. Res. 137(1): 93-109 (2002) - [j14]Lushu Li, Santosh N. Kabadi, Kunhiraman Nair:
Fuzzy models for single-period inventory problem. Fuzzy Sets Syst. 132(3): 273-289 (2002) - 2001
- [j13]Santosh N. Kabadi, Yash P. Aneja:
Equivalence of epsilon-Approximate Separation and Optimization in Fixed Dimensions. Algorithmica 29(4): 582-594 (2001) - [j12]Santosh N. Kabadi:
Generalisations of the Gilmore-Gomory Traveling Salesman Problem and the Gilmore-Gomory Scheme: a Survey. IGTR 3(2-3): 213-235 (2001)
1990 – 1999
- 1999
- [j11]Santosh N. Kabadi, Md. Fazle Baki:
Gilmore-Gomory type traveling salesman problems. Comput. Oper. Res. 26(4): 329-351 (1999) - [j10]Md. Fazle Baki, Santosh N. Kabadi:
Pyramidal traveling salesman problem. Comput. Oper. Res. 26(4): 353-369 (1999) - 1998
- [j9]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): 105-110 (1998) - [j8]Md. Fazle Baki, Santosh N. Kabadi:
A generalization of the convex-hull-and-line traveling salesman problem. Adv. Decis. Sci. 2(2): 177-191 (1998) - [j7]R. Chandrasekaran, Santosh N. Kabadi, R. Sridhar:
Integer Solution for Linear Complementarity Problem. Math. Oper. Res. 23(2): 390-402 (1998) - 1997
- [j6]Santosh N. Kabadi, Yash P. Aneja:
An Efficient, Strongly Polynomial, epsilon-Approximation Schemes. Inf. Process. Lett. 64(4): 173-177 (1997) - 1996
- [j5]Santosh N. Kabadi, Y. P. Aneia:
ε-Approximation minimization of convex functions in fixed dimension. Oper. Res. Lett. 18(4): 171-176 (1996) - 1990
- [j4]Santosh N. Kabadi, Ramaswamy Chandrasekaran:
On totally dual integral systems. Discret. Appl. Math. 26(1): 87-104 (1990) - [c1]Santosh N. Kabadi, Ramaswamy Chandrasekaran:
Solvable Classes of Generalized Traveling Salesman Polytope. Polyhedral Combinatorics 1990: 49-60
1980 – 1989
- 1988
- [j3]R. Chandrasekaran, Santosh N. Kabadi:
Pseudomatroids. Discret. Math. 71(3): 205-217 (1988) - 1987
- [j2]Katta G. Murty, Santosh N. Kabadi:
Some NP-complete problems in quadratic and nonlinear programming. Math. Program. 39(2): 117-129 (1987) - 1982
- [j1]R. Chandrasekaran, Santosh N. Kabadi, Katta G. Murty:
Some NP-complete problems in linear programming. Oper. Res. Lett. 1(3): 101-104 (1982)
Coauthor Index
aka: R. Chandrasekaran
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
