Abraham P. Punnen

According to our database1, Abraham P. Punnen authored at least 93 papers between 1992 and 2022.

Collaborative distances:



In proceedings 
PhD thesis 


On csauthors.net:


The Bipartite Boolean Quadric Polytope.
Discret. Optim., 2022

Preface: Quadratic combinatorial optimization problems.
Discret. Optim., 2022

The Rank-One Quadratic Assignment Problem.
INFORMS J. Comput., 2021

A Fast and Robust Heuristic Algorithm for the Minimum Weight Vertex Cover Problem.
IEEE Access, 2021

A two-individual based path-relinking algorithm for the satellite broadcast scheduling problem.
Knowl. Based Syst., 2020

A class of exponential neighbourhoods for the quadratic travelling salesman problem.
J. Comb. Optim., 2020

Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms.
INFORMS J. Comput., 2020

An effective multi-wave algorithm for solving the max-mean dispersion problem.
J. Heuristics, 2019

Combinatorial optimization with interaction costs: Complexity and solvable cases.
Discret. Optim., 2019

Representations of quadratic combinatorial optimization problems: A case study using quadratic set covering and quadratic knapsack problems.
Comput. Oper. Res., 2019

A characterization of linearizable instances of the quadratic minimum spanning tree problem.
J. Comb. Optim., 2018

Adaptive tabu search with strategic oscillation for the bipartite boolean quadratic programming problem with partitioned variables.
Inf. Sci., 2018

The generalized vertex cover problem and some variations.
Discret. Optim., 2018

The quadratic minimum spanning tree problem and its variations.
Discret. Optim., 2018

Representations of quadratic combinatorial optimization problems: A case study using the quadratic set covering problem.
CoRR, 2018

Very Large-Scale Neighborhood Search: Theory, Algrithms, and Applications.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis.
Oper. Res. Lett., 2017

On a linearization technique for solving the quadratic set covering problem and variations.
Optim. Lett., 2017

The bilinear assignment problem: complexity and polynomially solvable special cases.
Math. Program., 2017

Markov Chain methods for the Bipartite Boolean Quadratic Programming Problem.
Eur. J. Oper. Res., 2017

A linear time algorithm for the -neighbour Travelling Salesman Problem on a Halin graph and extensions.
Discret. Optim., 2017

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

The boolean quadratic programming problem with generalized upper bound constraints.
Comput. Oper. Res., 2017

Clustered maximum weight clique problem: Algorithms and empirical analysis.
Comput. Oper. Res., 2017

Priority allocation rules for single machine total weighted linear and square tardiness problems.
Prod. Eng., 2016

The bipartite quadratic assignment problem and extensions.
Eur. J. Oper. Res., 2016

Multi-component approach to the bipartite Boolean quadratic programming problem.
CoRR, 2016

Average value of solutions for the bipartite boolean quadratic programs and rounding algorithms.
Theor. Comput. Sci., 2015

Integrating tabu search and VLSN search to develop enhanced algorithms: A case study using bipartite boolean quadratic programs.
Eur. J. Oper. Res., 2015

The bipartite unconstrained 0-1 quadratic programming problem: Polynomially solvable cases.
Discret. Appl. Math., 2015

A Linear Time Algorithm for the $3$-Neighbour Traveling Salesman Problem on Halin graphs and extensions.
CoRR, 2015

A Network Model for the Hospital Routing Problem.
Proceedings of the ICORES 2015, 2015

The quadratic balanced optimization problem.
Discret. Optim., 2014

The asymmetric bottleneck traveling salesman problem: Algorithms, complexity and empirical analysis.
Comput. Oper. Res., 2014

A reduced integer programming model for the ferry scheduling problem.
Public Transp., 2013

Quadratic bottleneck knapsack problems.
J. Heuristics, 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

The minimum cost perfect matching problem with conflict pair constraints.
Comput. Oper. Res., 2013

Domination Analysis of Algorithms for Bipartite Boolean Quadratic Programs.
Proceedings of the Fundamentals of Computation Theory - 19th International Symposium, 2013

Experimental analysis of heuristics for the bottleneck traveling salesman problem.
J. Heuristics, 2012

Analysis of an approximate greedy algorithm for the maximum edge clique partitioning problem.
Discret. Optim., 2012

Strong and weak edges of a graph and linkages with the vertex cover problem.
Discret. Appl. Math., 2012

Three value TSP and linkages with the three value linear spanning 2-forests.
Discret. Appl. Math., 2012

Heuristic algorithms for the bipartite unconstrained 0-1 quadratic programming problem
CoRR, 2012

An ejection-chain heuristic for the satellite downlink scheduling problem: A case study with RADARSAT-2
CoRR, 2012

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

On generalized balanced optimization problems.
Math. Methods Oper. Res., 2011

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

The balanced traveling salesmanproblem.
Comput. Oper. Res., 2011

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

Variable Intensity Local Search.
Proceedings of the Matheuristics - Hybridizing Metaheuristics and Mathematical Programming, 2010

SC-Hamiltonicity and Its Linkages with Strong Hamiltonicity of a Graph.
SIAM J. Discret. Math., 2010

SC-Hamiltonian graphs and digraphs: New necessary conditions and their impacts.
Discret. Math., 2010

The quadratic minimum spanning tree problem: A lower bounding procedure and an efficient search algorithm.
Comput. Oper. Res., 2010

On the Approximability of the Vertex Cover and Related Problems.
Proceedings of the Algorithmic Aspects in Information and Management, 2010

An edge-reduction algorithm for the vertex cover problem.
Oper. Res. Lett., 2009

Bottleneck flows in unit capacity networks.
Inf. Process. Lett., 2009

Local search intensified: Very large-scale variable neighborhood search for the multi-resource generalized assignment problem.
Discret. Optim., 2009

Integer Programming: Optimization and Evaluation Are Equivalent.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

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

Very Large-Scale Neighborhood Search.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

A simplex algorithm for piecewise-linear fractional programming problems.
Eur. J. Oper. Res., 2007

Bottleneck flows in networks
CoRR, 2007

A polynomial time $\frac 3 2$ -approximation algorithm for the vertex cover problem on a class of graphs
CoRR, 2007

Learning multicriteria fuzzy classification method PROAFTN from data.
Comput. Oper. Res., 2007

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

Variations of the prize-collecting Steiner tree problem.
Networks, 2006

The traveling salesman problem.
Discret. Optim., 2006

Adv. Decis. Sci., 2005

Minmax strongly connected subgraphs with node penalties.
Adv. Decis. Sci., 2005

The bottleneck <i>k</i>-MST.
Inf. Process. Lett., 2005

Approximate Local Search in Combinatorial Optimization.
SIAM J. Comput., 2004

Lexicographic balanced optimization problems.
Oper. Res. Lett., 2004

On bottleneck assignment problems under categorization.
Comput. Oper. Res., 2004

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

TSP Heuristics: Domination Analysis and Complexity.
Algorithmica, 2003

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

A survey of very large-scale neighborhood search techniques.
Discret. Appl. Math., 2002

Multiple bottleneck assignment problem.
Eur. J. Oper. Res., 1999

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

Minimum Dispersion Problems.
Discret. Appl. Math., 1997

On k-sum optimization.
Oper. Res. Lett., 1996

An Improved Algorithm for the Constrained Bottleneck Spanning Tree Problem.
INFORMS J. Comput., 1996

A Fast Algorithm for a Class of Bottleneck Problems.
Computing, 1996

Constrained Matroidal Bottleneck Problems.
Discret. Appl. Math., 1995

A Fast and Simple Algorithm for the Bottleneck Biconnected Spanning Subgraph Problem.
Inf. Process. Lett., 1994

Improved Complexity Bound for the Maximum Cardinality Bottleneck Bipartite Matching Problem.
Discret. Appl. Math., 1994

On combined minmax-minsum optimization.
Comput. Oper. Res., 1994

On: Travelling salesman problem under categorization: Operations Research Letters 12 (1992) 89-95.
Oper. Res. Lett., 1993

Traveling salesman problem under categorization.
Oper. Res. Lett., 1992

Minimum Perfect Bipartite Matchings and Spanning Trees under Categorization.
Discret. Appl. Math., 1992