Abraham P. Punnen

ORCID

Publication Activity (10 Years)

Years Active: 1992-2024
Publications (10 Years): 38

Top Venues

Publications

Abraham P. Punnen, Jasdeep Dhahan
The Knapsack Problem with Conflict Pair Constraints on Bipartite Graphs and Extensions. Algorithms 17 (5) (2024)
Wei Yang, Yang Wang, Ante Custic, Abraham P. Punnen
Experimental analysis of algorithms for the independent quadratic assignment problem. Comput. Oper. Res. 168 (2024)
Abraham P. Punnen, Navpreet Kaur
Revisiting some classical linearizations of the quadratic binary optimization problem. CoRR (2024)
Abraham P. Punnen, Navpreet Kaur
Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations. Discret. Optim. 54 (2024)
Zhongxiang Chang, Abraham P. Punnen, Zhongbao Zhou, Shi Cheng
Solving dynamic satellite image data downlink scheduling problem via an adaptive bi-objective optimization algorithm. Comput. Oper. Res. 160 (2023)
Yang Wang, Haichao Liu, Bo Peng, Haibo Wang, Abraham P. Punnen
A three-phase matheuristic algorithm for the multi-day task assignment problem. Comput. Oper. Res. 159 (2023)
Abraham P. Punnen, Renata Sotirov
Preface: Quadratic combinatorial optimization problems. Discret. Optim. 44 (Part) (2022)
Zhongxiang Chang, Abraham P. Punnen, Zhongbao Zhou
An adaptive bi-objective optimization algorithm for the satellite image data downlink scheduling problem considering request split. CoRR (2022)
Zhongxiang Chang, Abraham P. Punnen, Zhongbao Zhou
Multi-strip observation scheduling problem for ac-tive-imaging agile earth observation satellites. CoRR (2022)
Piyashat Sripratak, Abraham P. Punnen, Tamon Stephen
The Bipartite Boolean Quadric Polytope. Discret. Optim. 44 (Part) (2022)
Yang Wang, Wei Yang, Abraham P. Punnen, Jingbo Tian, Aihua Yin, Zhipeng Lü
The Rank-One Quadratic Assignment Problem. INFORMS J. Comput. 33 (3) (2021)
Yang Wang, Zhipeng Lü, Abraham P. Punnen
A Fast and Robust Heuristic Algorithm for the Minimum Weight Vertex Cover Problem. IEEE Access 9 (2021)
Brad D. Woods, Abraham P. Punnen
A class of exponential neighbourhoods for the quadratic travelling salesman problem. J. Comb. Optim. 40 (2) (2020)
Bo Peng, Yuan Zhang, T. C. E. Cheng, Zhipeng Lü, Abraham P. Punnen
A two-individual based path-relinking algorithm for the satellite broadcast scheduling problem. Knowl. Based Syst. 196 (2020)
Vladyslav Sokol, Ante Custic, Abraham P. Punnen, Binay Bhattacharya
Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms. INFORMS J. Comput. 32 (3) (2020)
Abraham P. Punnen, Pooja Pandey, Michael Friesen
Representations of quadratic combinatorial optimization problems: A case study using quadratic set covering and quadratic knapsack problems. Comput. Oper. Res. 112 (2019)
Stefan Lendl, Ante Custic, Abraham P. Punnen
Combinatorial optimization with interaction costs: Complexity and solvable cases. Discret. Optim. 33 (2019)
Jiawei Song, Yang Wang, Haibo Wang, Qinghua Wu, Abraham P. Punnen
An effective multi-wave algorithm for solving the max-mean dispersion problem. J. Heuristics 25 (4-5) (2019)
Pooja Pandey, Abraham P. Punnen
The generalized vertex cover problem and some variations. Discret. Optim. 30 (2018)
Ante Custic, Ruonan Zhang, Abraham P. Punnen
The quadratic minimum spanning tree problem and its variations. Discret. Optim. 27 (2018)
Yang Wang, Qinghua Wu, Abraham P. Punnen, Fred W. Glover
Adaptive tabu search with strategic oscillation for the bipartite boolean quadratic programming problem with partitioned variables. Inf. Sci. 450 (2018)
Ante Custic, Abraham P. Punnen
A characterization of linearizable instances of the quadratic minimum spanning tree problem. J. Comb. Optim. 35 (2) (2018)
Abraham P. Punnen, Pooja Pandey
Representations of quadratic combinatorial optimization problems: A case study using the quadratic set covering problem. CoRR (2018)
Brad D. Woods, Abraham P. Punnen, Tamon Stephen
A linear time algorithm for the -neighbour Travelling Salesman Problem on a Halin graph and extensions. Discret. Optim. 26 (2017)
Ante Custic, Abraham P. Punnen
Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis. Oper. Res. Lett. 45 (3) (2017)
Abraham P. Punnen, Brad D. Woods, Santosh N. Kabadi
A characterization of Linearizable instances of the Quadratic Traveling Salesman Problem. CoRR (2017)
Daniel Karapetyan, Abraham P. Punnen, Andrew J. Parkes
Markov Chain methods for the Bipartite Boolean Quadratic Programming Problem. Eur. J. Oper. Res. 260 (2) (2017)
Yang Wang, Abraham P. Punnen
The boolean quadratic programming problem with generalized upper bound constraints. Comput. Oper. Res. 77 (2017)
Vladyslav Sokol, Ante Custic, Abraham P. Punnen, Binay Bhattacharya
Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms. CoRR (2017)
Brad D. Woods, Abraham P. Punnen
A class of exponential neighbourhoods for the quadratic travelling salesman problem. CoRR (2017)
Pooja Pandey, Abraham P. Punnen
On a linearization technique for solving the quadratic set covering problem and variations. Optim. Lett. 11 (7) (2017)
Ante Custic, Vladyslav Sokol, Abraham P. Punnen, Binay Bhattacharya
The bilinear assignment problem: complexity and polynomially solvable special cases. Math. Program. 166 (1-2) (2017)
Krishna Teja Malladi, Snezana Mitrovic-Minic, Abraham P. Punnen
Clustered maximum weight clique problem: Algorithms and empirical analysis. Comput. Oper. Res. 85 (2017)
Pooja Pandey, Abraham P. Punnen
The generalized vertex cover problem and some variations. CoRR (2017)
Daniel Karapetyan, Abraham P. Punnen, Andrew J. Parkes
Multi-component approach to the bipartite Boolean quadratic programming problem. CoRR (2016)
Aihua Yin, Abraham P. Punnen, Dongping Hu
Priority allocation rules for single machine total weighted linear and square tardiness problems. Prod. Eng. 10 (4-5) (2016)
Abraham P. Punnen, Yang Wang
The bipartite quadratic assignment problem and extensions. Eur. J. Oper. Res. 250 (3) (2016)
Ante Custic, Ruonan Zhang, Abraham P. Punnen
The Quadratic Minimum Spanning Tree Problem and its Variations. CoRR (2016)
Pooja Pandey, Abraham P. Punnen
On a linearization technique for solving quadratic set covering problem and variations. CoRR (2015)
Abraham P. Punnen, Piyashat Sripratak, Daniel Karapetyan
The bipartite unconstrained 0-1 quadratic programming problem: Polynomially solvable cases. Discret. Appl. Math. 193 (2015)
Abraham P. Punnen, Piyashat Sripratak, Daniel Karapetyan
Average value of solutions for the bipartite boolean quadratic programs and rounding algorithms. Theor. Comput. Sci. 565 (2015)
Ante Custic, Abraham P. Punnen
A characterization of linearizable instances of the quadratic minimum spanning tree problem. CoRR (2015)
Brad D. Woods, Abraham P. Punnen, Tamon Stephen
A Linear Time Algorithm for the $3$-Neighbour Traveling Salesman Problem on Halin graphs and extensions. CoRR (2015)
Arash Rafiey, Vladyslav Sokol, Ramesh Krishnamurti, Snezana Mitrovic-Minic, Abraham P. Punnen, Krishna Teja Malladi
A Network Model for the Hospital Routing Problem. ICORES (2015)
Fred W. Glover, Tao Ye, Abraham P. Punnen, Gary A. Kochenberger
Integrating tabu search and VLSN search to develop enhanced algorithms: A case study using bipartite boolean quadratic programs. Eur. J. Oper. Res. 241 (3) (2015)
John Larusic, Abraham P. Punnen
The asymmetric bottleneck traveling salesman problem: Algorithms, complexity and empirical analysis. Comput. Oper. Res. 43 (2014)
Abraham P. Punnen, Sara Taghipour, Daniel Karapetyan, Bishnu Bhattacharyya
The quadratic balanced optimization problem. Discret. Optim. 12 (2014)
Santosh N. Kabadi, Abraham P. Punnen
Spanning cactus of a graph: Existence, extension, optimization, and approximation. Discret. Appl. Math. 161 (1-2) (2013)
Temel Öncan, Ruonan Zhang, Abraham P. Punnen
The minimum cost perfect matching problem with conflict pair constraints. Comput. Oper. Res. 40 (4) (2013)
Ruonan Zhang, Abraham P. Punnen
Quadratic bottleneck knapsack problems. J. Heuristics 19 (4) (2013)
Abraham P. Punnen, Piyashat Sripratak, Daniel Karapetyan
Domination Analysis of Algorithms for Bipartite Boolean Quadratic Programs. FCT (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)
Daniel Karapetyan, Abraham P. Punnen
A reduced integer programming model for the ferry scheduling problem. Public Transp. 4 (3) (2013)
Abraham P. Punnen, Piyashat Sripratak, Daniel Karapetyan
Average value of solutions for the bipartite boolean quadratic programs and rounding algorithms CoRR (2013)
Fred W. Glover, Tao Ye, Abraham P. Punnen, Gary A. Kochenberger
Integrating tabu search and VLSN search to develop enhanced algorithms: A case study using bipartite boolean quadratic programs. CoRR (2013)
Abraham P. Punnen, Piyashat Sripratak, Daniel Karapetyan
The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases CoRR (2012)
Abraham P. Punnen, Ruonan Zhang
Analysis of an approximate greedy algorithm for the maximum edge clique partitioning problem. Discret. Optim. 9 (3) (2012)
Qiaoming Han, Abraham P. Punnen
Strong and weak edges of a graph and linkages with the vertex cover problem. Discret. Appl. Math. 160 (3) (2012)
Daniel Karapetyan, Abraham P. Punnen
A reduced integer programming model for the ferry scheduling problem CoRR (2012)
Daniel K. Benvenuti, Abraham P. Punnen
Three value TSP and linkages with the three value linear spanning 2-forests. Discret. Appl. Math. 160 (1-2) (2012)
Abraham P. Punnen, Sara Taghipour, Daniel Karapetyan, Bishnu Bhattacharyya
The quadratic balanced optimization problem CoRR (2012)
Daniel Karapetyan, Abraham P. Punnen
Heuristic algorithms for the bipartite unconstrained 0-1 quadratic programming problem CoRR (2012)
Daniel Karapetyan, Krishna T. Malladi, Snezana Mitrovic-Minic, Abraham P. Punnen
An ejection-chain heuristic for the satellite downlink scheduling problem: A case study with RADARSAT-2 CoRR (2012)
John Larusic, Abraham P. Punnen, Eric Aubanel
Experimental analysis of heuristics for the bottleneck traveling salesman problem. J. Heuristics 18 (3) (2012)
Santosh N. Kabadi, Abraham P. Punnen
) Algorithm for the QAP Linearization Problem. Math. Oper. Res. 36 (4) (2011)
John Larusic, Abraham P. Punnen
The balanced traveling salesmanproblem. Comput. Oper. Res. 38 (5) (2011)
Lara Turner, Abraham P. Punnen, Yash P. Aneja, Horst W. Hamacher
On generalized balanced optimization problems. Math. Methods Oper. Res. 73 (1) (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)
Qiaoming Han, Abraham P. Punnen
On the Approximability of the Vertex Cover and Related Problems. AAIM (2010)
Daniel K. Benvenuti, Abraham P. Punnen
SC-Hamiltonian graphs and digraphs: New necessary conditions and their impacts. Discret. Math. 310 (21) (2010)
Temel Öncan, Abraham P. Punnen
The quadratic minimum spanning tree problem: A lower bounding procedure and an efficient search algorithm. Comput. Oper. Res. 37 (10) (2010)
Daniel K. Benvenuti, Abraham P. Punnen
SC-Hamiltonicity and Its Linkages with Strong Hamiltonicity of a Graph. SIAM J. Discret. Math. 23 (4) (2010)
James B. Orlin, Abraham P. Punnen, Andreas S. Schulz
Integer Programming: Optimization and Evaluation Are Equivalent. WADS (2009)
Snezana Mitrovic-Minic, Abraham P. Punnen
Local search intensified: Very large-scale variable neighborhood search for the multi-resource generalized assignment problem. Discret. Optim. 6 (4) (2009)
Abraham P. Punnen, Ruonan Zhang
Bottleneck flows in unit capacity networks. Inf. Process. Lett. 109 (6) (2009)
Qiaoming Han, Abraham P. Punnen, Yinyu Ye
An edge-reduction algorithm for the vertex cover problem. Oper. Res. Lett. 37 (3) (2009)
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)
Nabil Belacel, Hiral Bhasker Raval, Abraham P. Punnen
Learning multicriteria fuzzy classification method PROAFTN from data. Comput. Oper. Res. 34 (7) (2007)
Abraham P. Punnen, Ruonan Zhang
Bottleneck flows in networks CoRR (2007)
Qiaoming Han, Abraham P. Punnen
On the approximability of the vertex cover and related problems CoRR (2007)
Pooja Pandey, Abraham P. Punnen
A simplex algorithm for piecewise-linear fractional programming problems. Eur. J. Oper. Res. 178 (2) (2007)
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)
Gregory Z. Gutin, Abraham P. Punnen
The traveling salesman problem. Discret. Optim. 3 (1) (2006)
Olena Chapovska, Abraham P. Punnen
Variations of the prize-collecting Steiner tree problem. Networks 47 (4) (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)
Abraham P. Punnen, Olena Chapovska
-MST. Inf. Process. Lett. 95 (5) (2005)
Abraham P. Punnen
Minmax strongly connected subgraphs with node penalties. Adv. Decis. Sci. 9 (2) (2005)
Abraham P. Punnen, Prabha Sharma, Chin Diew Lai, Mahyar A. Amouzegar
Preface. Adv. Decis. Sci. 9 (2) (2005)
James B. Orlin, Abraham P. Punnen, Andreas S. Schulz
Approximate Local Search in Combinatorial Optimization. SIAM J. Comput. 33 (5) (2004)
Abraham P. Punnen, Yash P. Aneja
Lexicographic balanced optimization problems. Oper. Res. Lett. 32 (1) (2004)
Abraham P. Punnen
On bottleneck assignment problems under categorization. Comput. Oper. Res. 31 (1) (2004)
James B. Orlin, Abraham P. Punnen, Andreas S. Schulz
Approximate local search in combinatorial optimization. SODA (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)
Abraham P. Punnen, Santosh N. Kabadi
Domination analysis of some heuristics for the traveling salesman problem. Discret. Appl. Math. 119 (1-2) (2002)
Ravindra K. Ahuja, Özlem Ergun, James B. Orlin, Abraham P. Punnen
A survey of very large-scale neighborhood search techniques. Discret. Appl. Math. 123 (1-3) (2002)
Yash P. Aneja, Abraham P. Punnen
Multiple bottleneck assignment problem. Eur. J. Oper. Res. 112 (1) (1999)
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)

Abraham P. Punnen.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Abraham P. Punnen