| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | John Larusic, Abraham P. Punnen, Eric Aubanel |
Experimental analysis of heuristics for the bottleneck traveling salesman problem.  |
J. Heuristics  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel K. Benvenuti, Abraham P. Punnen |
Three value TSP and linkages with the three value linear spanning 2-forests. |
Discrete Applied Mathematics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Qiaoming Han, Abraham P. Punnen |
Strong and weak edges of a graph and linkages with the vertex cover problem. |
Discrete Applied Mathematics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ruonan Zhang, Santosh N. Kabadi, Abraham P. Punnen |
The minimum spanning tree problem with conflict constraints and its variations. |
Discrete Optimization |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Santosh N. Kabadi, Abraham P. Punnen |
Trioid: A generalization of matroid and the associated polytope. |
Algorithmic Operations Research |
2011 |
DBLP BibTeX RDF |
|
| 1 | John Larusic, Abraham P. Punnen |
The balanced traveling salesmanproblem. |
Computers & OR |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel K. Benvenuti, Abraham P. Punnen |
SC-Hamiltonian graphs and digraphs: New necessary conditions and their impacts. |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Temel Öncan, Abraham P. Punnen |
The quadratic minimum spanning tree problem: A lower bounding procedure and an efficient search algorithm. |
Computers & OR |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel K. Benvenuti, Abraham P. Punnen |
SC-Hamiltonicity and Its Linkages with Strong Hamiltonicity of a Graph. |
SIAM J. Discrete Math. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Snezana Mitrovic-Minic, Abraham P. Punnen |
Variable Intensity Local Search. |
Matheuristics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Qiaoming Han, Abraham P. Punnen |
On the Approximability of the Vertex Cover and Related Problems. |
AAIM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Qiaoming Han, Abraham P. Punnen, Yinyu Ye |
An edge-reduction algorithm for the vertex cover problem. |
Oper. Res. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Snezana Mitrovic-Minic, Abraham P. Punnen |
Local search intensified: Very large-scale variable neighborhood search for the multi-resource generalized assignment problem. |
Discrete Optimization |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Abraham P. Punnen, Ruonan Zhang |
Bottleneck flows in unit capacity networks. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | James B. Orlin, Abraham P. Punnen, Andreas S. Schulz |
Integer Programming: Optimization and Evaluation Are Equivalent. |
WADS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Santosh N. Kabadi, Abraham P. Punnen |
A strongly polynomial simplex method for the linear fractional assignment problem. |
Oper. Res. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Pooja Pandey, Abraham P. Punnen |
A simplex algorithm for piecewise-linear fractional programming problems. |
European Journal of Operational Research |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Nabil Belacel, Hiral Bhasker Raval, Abraham P. Punnen |
Learning multicriteria fuzzy classification method PROAFTN from data. |
Computers & OR |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Abraham P. Punnen, Ruonan Zhang |
Bottleneck flows in networks |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Qiaoming Han, Abraham P. Punnen, Yinyu Ye |
A polynomial time $\frac 3 2$ -approximation algorithm for the vertex cover problem on a class of graphs |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Qiaoming Han, Abraham P. Punnen |
On the approximability of the vertex cover and related problems |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Olena Chapovska, Abraham P. Punnen |
Variations of the prize-collecting Steiner tree problem. |
Networks |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Santosh N. Kabadi, Abraham P. Punnen |
On cost matrices with two and three distinct values of Hamiltonian paths and cycles. |
SIAM J. Discrete Math. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Abraham P. Punnen |
Minmax strongly connected subgraphs with node penalties. |
JAMDS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Abraham P. Punnen, Prabha Sharma, Chin Diew Lai, Mahyar A. Amouzegar |
Preface. |
JAMDS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Abraham P. Punnen, Olena Chapovska |
The bottleneck k-MST. |
Inf. Process. Lett. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Abraham P. Punnen, Yash P. Aneja |
Lexicographic balanced optimization problems. |
Oper. Res. Lett. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Abraham P. Punnen |
On bottleneck assignment problems under categorization. |
Computers & OR |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | James B. Orlin, Abraham P. Punnen, Andreas S. Schulz |
Approximate Local Search in Combinatorial Optimization. |
SIAM J. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | James B. Orlin, Abraham P. Punnen, Andreas S. Schulz |
Approximate local search in combinatorial optimization. |
SODA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Santosh N. Kabadi, Abraham P. Punnen |
Weighted graphs with all Hamiltonian cycles of the same length. |
Discrete Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Abraham P. Punnen, François Margot, Santosh N. Kabadi |
TSP Heuristics: Domination Analysis and Complexity. |
Algorithmica |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Abraham P. Punnen, Santosh N. Kabadi |
Domination analysis of some heuristics for the traveling salesman problem. |
Discrete Applied Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Ravindra K. Ahuja, Özlem Ergun, James B. Orlin, Abraham P. Punnen |
A survey of very large-scale neighborhood search techniques. |
Discrete Applied Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Yash P. Aneja, Abraham P. Punnen |
Multiple bottleneck assignment problem. |
European Journal of Operational Research |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Abraham P. Punnen, Yash P. Aneja |
Minimum Dispersion Problems. |
Discrete Applied Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Abraham P. Punnen |
A Fast Algorithm for a Class of Bottleneck Problems. |
Computing |
1996 |
DBLP DOI BibTeX RDF |
Bottleneck problems, combinatorial optimization, polynomial algorithms |
| 1 | Abraham P. Punnen, K. P. K. Nair |
An Improved Algorithm for the Constrained Bottleneck Spanning Tree Problem. |
INFORMS Journal on Computing |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Averbakh, Oded Berman, Abraham P. Punnen |
Constrained Matroidal Bottleneck Problems. |
Discrete Applied Mathematics |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Abraham P. Punnen, Kunhiraman Nair |
A Fast and Simple Algorithm for the Bottleneck Biconnected Spanning Subgraph Problem. |
Inf. Process. Lett. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Abraham P. Punnen |
On combined minmax-minsum optimization. |
Computers & OR |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Abraham P. Punnen, Kunhiraman Nair |
Improved Complexity Bound for the Maximum Cardinality Bottleneck Bipartite Matching Problem. |
Discrete Applied Mathematics |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael B. Richey, Abraham P. Punnen |
Minimum Perfect Bipartite Matchings and Spanning Trees under Categorization. |
Discrete Applied Mathematics |
1992 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")