Abraham P. Punnen

118 papers A* 1B 2C 2Journal 110
YearRankTypeTitle / Venue / Authors
2026 J jnl
Mixed-integer linear programming and constraint programming formulations for solving the three-stage no-wait surgery scheduling problem.
Comput. Ind. Eng.
Yaohui Guo, Yang Wang, Zequn Wei, Abraham P. Punnen
2025 J jnl
Integrating patient satisfaction into operating room scheduling decisions.
Comput. Ind. Eng.
Xue Yang, Haichao Liu, Yang Wang, Abraham P. Punnen, Haibo Wang
2025 J jnl
Multi-strip observation scheduling problem for active-imaging agile earth observation satellites.
Neural Comput. Appl.
Zhongxiang Chang, Abraham P. Punnen, Zhongbao Zhou
2025 J jnl
The independent quadratic assignment problem: complexity and polynomially solvable special cases.
J. Comb. Optim.
Ante Custic, Wei Yang, Yang Wang, Abraham P. Punnen
2024 J jnl
Experimental analysis of algorithms for the independent quadratic assignment problem.
Comput. Oper. Res.
Wei Yang, Yang Wang, Ante Custic, Abraham P. Punnen
2024 J jnl
Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations.
Discret. Optim.
Abraham P. Punnen, Navpreet Kaur
2024 J jnl
Revisiting some classical linearizations of the quadratic binary optimization problem.
CoRR
Abraham P. Punnen, Navpreet Kaur
2024 J jnl
The Knapsack Problem with Conflict Pair Constraints on Bipartite Graphs and Extensions.
Algorithms
Abraham P. Punnen, Jasdeep Dhahan
2023 J jnl
A three-phase matheuristic algorithm for the multi-day task assignment problem.
Comput. Oper. Res.
Yang Wang, Haichao Liu, Bo Peng, Haibo Wang, Abraham P. Punnen
2023 J jnl
Solving dynamic satellite image data downlink scheduling problem via an adaptive bi-objective optimization algorithm.
Comput. Oper. Res.
Zhongxiang Chang, Abraham P. Punnen, Zhongbao Zhou, Shi Cheng
2022 J jnl
An adaptive bi-objective optimization algorithm for the satellite image data downlink scheduling problem considering request split.
CoRR
Zhongxiang Chang, Abraham P. Punnen, Zhongbao Zhou
2022 J jnl
Multi-strip observation scheduling problem for ac-tive-imaging agile earth observation satellites.
CoRR
Zhongxiang Chang, Abraham P. Punnen, Zhongbao Zhou
2022 J jnl
Preface: Quadratic combinatorial optimization problems.
Discret. Optim.
Abraham P. Punnen, Renata Sotirov
2022 J jnl
The Bipartite Boolean Quadric Polytope.
Discret. Optim.
Piyashat Sripratak, Abraham P. Punnen, Tamon Stephen
2021 J jnl
A Fast and Robust Heuristic Algorithm for the Minimum Weight Vertex Cover Problem.
IEEE Access
Yang Wang, Zhipeng Lü, Abraham P. Punnen
2021 J jnl
The Rank-One Quadratic Assignment Problem.
INFORMS J. Comput.
Yang Wang, Wei Yang, Abraham P. Punnen, Jingbo Tian, Aihua Yin, Zhipeng Lü
2020 J jnl
A class of exponential neighbourhoods for the quadratic travelling salesman problem.
J. Comb. Optim.
Brad D. Woods, Abraham P. Punnen
2020 J jnl
A two-individual based path-relinking algorithm for the satellite broadcast scheduling problem.
Knowl. Based Syst.
Bo Peng, Yuan Zhang, T. C. E. Cheng, Zhipeng Lü, Abraham P. Punnen
2020 J jnl
Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms.
INFORMS J. Comput.
Vladyslav Sokol, Ante Custic, Abraham P. Punnen, Binay Bhattacharya
2019 J jnl
An effective multi-wave algorithm for solving the max-mean dispersion problem.
J. Heuristics
Jiawei Song, Yang Wang, Haibo Wang, Qinghua Wu, Abraham P. Punnen
2019 J jnl
Combinatorial optimization with interaction costs: Complexity and solvable cases.
Discret. Optim.
Stefan Lendl, Ante Custic, Abraham P. Punnen
2019 J jnl
Representations of quadratic combinatorial optimization problems: A case study using quadratic set covering and quadratic knapsack problems.
Comput. Oper. Res.
Abraham P. Punnen, Pooja Pandey, Michael Friesen
2018 J jnl
A characterization of linearizable instances of the quadratic minimum spanning tree problem.
J. Comb. Optim.
Ante Custic, Abraham P. Punnen
2018 J jnl
Adaptive tabu search with strategic oscillation for the bipartite boolean quadratic programming problem with partitioned variables.
Inf. Sci.
Yang Wang, Qinghua Wu, Abraham P. Punnen, Fred W. Glover
2018 J jnl
Representations of quadratic combinatorial optimization problems: A case study using the quadratic set covering problem.
CoRR
Abraham P. Punnen, Pooja Pandey
2018 J jnl
The generalized vertex cover problem and some variations.
Discret. Optim.
Pooja Pandey, Abraham P. Punnen
2018 J jnl
The quadratic minimum spanning tree problem and its variations.
Discret. Optim.
Ante Custic, Ruonan Zhang, Abraham P. Punnen
2018 — ch.
Very Large-Scale Neighborhood Search: Theory, Algrithms, and Applications.
Handbook of Approximation Algorithms and Metaheuristics (1)
Ravindra K. Ahuja, Özlem Ergun, James B. Orlin, Abraham P. Punnen
2017 J jnl
A characterization of Linearizable instances of the Quadratic Traveling Salesman Problem.
CoRR
Abraham P. Punnen, Brad D. Woods, Santosh N. Kabadi
2017 J jnl
A class of exponential neighbourhoods for the quadratic travelling salesman problem.
CoRR
Brad D. Woods, Abraham P. Punnen
2017 J jnl
A linear time algorithm for the -neighbour Travelling Salesman Problem on a Halin graph and extensions.
Discret. Optim.
Brad D. Woods, Abraham P. Punnen, Tamon Stephen
2017 J jnl
Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis.
Oper. Res. Lett.
Ante Custic, Abraham P. Punnen
2017 J jnl
Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms.
CoRR
Vladyslav Sokol, Ante Custic, Abraham P. Punnen, Binay Bhattacharya
2017 J jnl
Clustered maximum weight clique problem: Algorithms and empirical analysis.
Comput. Oper. Res.
Krishna Teja Malladi, Snezana Mitrovic-Minic, Abraham P. Punnen
2017 J jnl
Markov Chain methods for the Bipartite Boolean Quadratic Programming Problem.
Eur. J. Oper. Res.
Daniel Karapetyan, Abraham P. Punnen, Andrew J. Parkes
2017 J jnl
On a linearization technique for solving the quadratic set covering problem and variations.
Optim. Lett.
Pooja Pandey, Abraham P. Punnen
2017 J jnl
The bilinear assignment problem: complexity and polynomially solvable special cases.
Math. Program.
Ante Custic, Vladyslav Sokol, Abraham P. Punnen, Binay Bhattacharya
2017 J jnl
The boolean quadratic programming problem with generalized upper bound constraints.
Comput. Oper. Res.
Yang Wang, Abraham P. Punnen
2017 J jnl
The generalized vertex cover problem and some variations.
CoRR
Pooja Pandey, Abraham P. Punnen
2016 J jnl
Multi-component approach to the bipartite Boolean quadratic programming problem.
CoRR
Daniel Karapetyan, Abraham P. Punnen, Andrew J. Parkes
2016 J jnl
Priority allocation rules for single machine total weighted linear and square tardiness problems.
Prod. Eng.
Aihua Yin, Abraham P. Punnen, Dongping Hu
2016 J jnl
The Quadratic Minimum Spanning Tree Problem and its Variations.
CoRR
Ante Custic, Ruonan Zhang, Abraham P. Punnen
2016 J jnl
The bipartite quadratic assignment problem and extensions.
Eur. J. Oper. Res.
Abraham P. Punnen, Yang Wang
2015 J jnl
A Linear Time Algorithm for the $3$-Neighbour Traveling Salesman Problem on Halin graphs and extensions.
CoRR
Brad D. Woods, Abraham P. Punnen, Tamon Stephen
2015 C conf
A Network Model for the Hospital Routing Problem.
ICORES
Arash Rafiey, Vladyslav Sokol, Ramesh Krishnamurti, Snezana Mitrovic-Minic, Abraham P. Punnen, Krishna Teja Malladi
2015 J jnl
A characterization of linearizable instances of the quadratic minimum spanning tree problem.
CoRR
Ante Custic, Abraham P. Punnen
2015 J jnl
Average value of solutions for the bipartite boolean quadratic programs and rounding algorithms.
Theor. Comput. Sci.
Abraham P. Punnen, Piyashat Sripratak, Daniel Karapetyan
2015 J jnl
Integrating tabu search and VLSN search to develop enhanced algorithms: A case study using bipartite boolean quadratic programs.
Eur. J. Oper. Res.
Fred W. Glover, Tao Ye, Abraham P. Punnen, Gary A. Kochenberger
2015 J jnl
On a linearization technique for solving quadratic set covering problem and variations.
CoRR
Pooja Pandey, Abraham P. Punnen
2015 J jnl
The bipartite unconstrained 0-1 quadratic programming problem: Polynomially solvable cases.
Discret. Appl. Math.
Abraham P. Punnen, Piyashat Sripratak, Daniel Karapetyan
2014 J jnl
The asymmetric bottleneck traveling salesman problem: Algorithms, complexity and empirical analysis.
Comput. Oper. Res.
John Larusic, Abraham P. Punnen
2014 J jnl
The quadratic balanced optimization problem.
Discret. Optim.
Abraham P. Punnen, Sara Taghipour, Daniel Karapetyan, Bishnu Bhattacharyya
2013 J jnl
A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems.
Discret. Optim.
Abraham P. Punnen, Santosh N. Kabadi
2013 J jnl
A reduced integer programming model for the ferry scheduling problem.
Public Transp.
Daniel Karapetyan, Abraham P. Punnen
2013 J jnl
Average value of solutions for the bipartite boolean quadratic programs and rounding algorithms
CoRR
Abraham P. Punnen, Piyashat Sripratak, Daniel Karapetyan
2013 B conf
Domination Analysis of Algorithms for Bipartite Boolean Quadratic Programs.
FCT
Abraham P. Punnen, Piyashat Sripratak, Daniel Karapetyan
2013 J jnl
Integrating tabu search and VLSN search to develop enhanced algorithms: A case study using bipartite boolean quadratic programs.
CoRR
Fred W. Glover, Tao Ye, Abraham P. Punnen, Gary A. Kochenberger
2013 J jnl
Quadratic bottleneck knapsack problems.
J. Heuristics
Ruonan Zhang, Abraham P. Punnen
2013 J jnl
Spanning cactus of a graph: Existence, extension, optimization, and approximation.
Discret. Appl. Math.
Santosh N. Kabadi, Abraham P. Punnen
2013 J jnl
The minimum cost perfect matching problem with conflict pair constraints.
Comput. Oper. Res.
Temel Öncan, Ruonan Zhang, Abraham P. Punnen
2012 J jnl
A reduced integer programming model for the ferry scheduling problem
CoRR
Daniel Karapetyan, Abraham P. Punnen
2012 J jnl
An ejection-chain heuristic for the satellite downlink scheduling problem: A case study with RADARSAT-2
CoRR
Daniel Karapetyan, Krishna T. Malladi, Snezana Mitrovic-Minic, Abraham P. Punnen
2012 J jnl
Analysis of an approximate greedy algorithm for the maximum edge clique partitioning problem.
Discret. Optim.
Abraham P. Punnen, Ruonan Zhang
2012 J jnl
Experimental analysis of heuristics for the bottleneck traveling salesman problem.
J. Heuristics
John Larusic, Abraham P. Punnen, Eric Aubanel
2012 J jnl
Heuristic algorithms for the bipartite unconstrained 0-1 quadratic programming problem
CoRR
Daniel Karapetyan, Abraham P. Punnen
2012 J jnl
Strong and weak edges of a graph and linkages with the vertex cover problem.
Discret. Appl. Math.
Qiaoming Han, Abraham P. Punnen
2012 J jnl
The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
CoRR
Abraham P. Punnen, Piyashat Sripratak, Daniel Karapetyan
2012 J jnl
The quadratic balanced optimization problem
CoRR
Abraham P. Punnen, Sara Taghipour, Daniel Karapetyan, Bishnu Bhattacharyya
2012 J jnl
Three value TSP and linkages with the three value linear spanning 2-forests.
Discret. Appl. Math.
Daniel K. Benvenuti, Abraham P. Punnen
2011 J jnl
An
Math. Oper. Res.
Santosh N. Kabadi, Abraham P. Punnen
2011 J jnl
On generalized balanced optimization problems.
Math. Methods Oper. Res.
Lara Turner, Abraham P. Punnen, Yash P. Aneja, Horst W. Hamacher
2011 J jnl
The balanced traveling salesmanproblem.
Comput. Oper. Res.
John Larusic, Abraham P. Punnen
2011 J jnl
The minimum spanning tree problem with conflict constraints and its variations.
Discret. Optim.
Ruonan Zhang, Santosh N. Kabadi, Abraham P. Punnen
2011 J jnl
Trioid: A generalization of matroid and the associated polytope.
Algorithmic Oper. Res.
Santosh N. Kabadi, Abraham P. Punnen
2010 C conf
On the Approximability of the Vertex Cover and Related Problems.
AAIM
Qiaoming Han, Abraham P. Punnen
2010 J jnl
SC-Hamiltonian graphs and digraphs: New necessary conditions and their impacts.
Discret. Math.
Daniel K. Benvenuti, Abraham P. Punnen
2010 J jnl
SC-Hamiltonicity and Its Linkages with Strong Hamiltonicity of a Graph.
SIAM J. Discret. Math.
Daniel K. Benvenuti, Abraham P. Punnen
2010 J jnl
The quadratic minimum spanning tree problem: A lower bounding procedure and an efficient search algorithm.
Comput. Oper. Res.
Temel Öncan, Abraham P. Punnen
2010 — ch.
Variable Intensity Local Search.
Matheuristics
Snezana Mitrovic-Minic, Abraham P. Punnen
2009 J jnl
An edge-reduction algorithm for the vertex cover problem.
Oper. Res. Lett.
Qiaoming Han, Abraham P. Punnen, Yinyu Ye
2009 J jnl
Bottleneck flows in unit capacity networks.
Inf. Process. Lett.
Abraham P. Punnen, Ruonan Zhang
2009 B conf
Integer Programming: Optimization and Evaluation Are Equivalent.
WADS
James B. Orlin, Abraham P. Punnen, Andreas S. Schulz
2009 J jnl
Local search intensified: Very large-scale variable neighborhood search for the multi-resource generalized assignment problem.
Discret. Optim.
Snezana Mitrovic-Minic, Abraham P. Punnen
2008 J jnl
A strongly polynomial simplex method for the linear fractional assignment problem.
Oper. Res. Lett.
Santosh N. Kabadi, Abraham P. Punnen
2008 J jnl
VLSN search algorithms for partitioning problems using matching neighbourhoods.
J. Oper. Res. Soc.
Temel Öncan, Santosh N. Kabadi, K. P. K. Nair, Abraham P. Punnen
2007 J jnl
A polynomial time $\frac 3 2$ -approximation algorithm for the vertex cover problem on a class of graphs
CoRR
Qiaoming Han, Abraham P. Punnen, Yinyu Ye
2007 J jnl
A simplex algorithm for piecewise-linear fractional programming problems.
Eur. J. Oper. Res.
Pooja Pandey, Abraham P. Punnen
2007 J jnl
Bottleneck flows in networks
CoRR
Abraham P. Punnen, Ruonan Zhang
2007 J jnl
Learning multicriteria fuzzy classification method PROAFTN from data.
Comput. Oper. Res.
Nabil Belacel, Hiral Bhasker Raval, Abraham P. Punnen
2007 J jnl
On the approximability of the vertex cover and related problems
CoRR
Qiaoming Han, Abraham P. Punnen
2007 — ch.
Very Large-Scale Neighborhood Search.
Handbook of Approximation Algorithms and Metaheuristics
Özlem Ergun, Abraham P. Punnen, James B. Orlin, Ravindra K. Ahuja
2006 J jnl
On cost matrices with two and three distinct values of Hamiltonian paths and cycles.
SIAM J. Discret. Math.
Santosh N. Kabadi, Abraham P. Punnen
2006 J jnl
The traveling salesman problem.
Discret. Optim.
Gregory Z. Gutin, Abraham P. Punnen
2006 J jnl
Variations of the prize-collecting Steiner tree problem.
Networks
Olena Chapovska, Abraham P. Punnen
2005 J jnl
Minmax strongly connected subgraphs with node penalties.
Adv. Decis. Sci.
Abraham P. Punnen
2005 J jnl
Preface.
Adv. Decis. Sci.
Abraham P. Punnen, Prabha Sharma, Chin Diew Lai, Mahyar A. Amouzegar
2005 J jnl
The bottleneck
Inf. Process. Lett.
Abraham P. Punnen, Olena Chapovska
2004 J jnl
Approximate Local Search in Combinatorial Optimization.
SIAM J. Comput.
James B. Orlin, Abraham P. Punnen, Andreas S. Schulz
2004 A* conf
Approximate local search in combinatorial optimization.
SODA
James B. Orlin, Abraham P. Punnen, Andreas S. Schulz
2004 J jnl
Lexicographic balanced optimization problems.
Oper. Res. Lett.
Abraham P. Punnen, Yash P. Aneja
2004 J jnl
On bottleneck assignment problems under categorization.
Comput. Oper. Res.
Abraham P. Punnen
2003 J jnl
TSP Heuristics: Domination Analysis and Complexity.
Algorithmica
Abraham P. Punnen, François Margot, Santosh N. Kabadi
2003 J jnl
Weighted graphs with all Hamiltonian cycles of the same length.
Discret. Math.
Santosh N. Kabadi, Abraham P. Punnen
2002 J jnl
A survey of very large-scale neighborhood search techniques.
Discret. Appl. Math.
Ravindra K. Ahuja, Özlem Ergun, James B. Orlin, Abraham P. Punnen
2002 J jnl
Domination analysis of some heuristics for the traveling salesman problem.
Discret. Appl. Math.
Abraham P. Punnen, Santosh N. Kabadi
1999 J jnl
Multiple bottleneck assignment problem.
Eur. J. Oper. Res.
Yash P. Aneja, Abraham P. Punnen
1998 J jnl
A Linear Time Algorithm for the Bottleneck Traveling Salesman Problem on a Halin Graph.
Inf. Process. Lett.
Jeffrey Mark Phillips, Abraham P. Punnen, Santosh N. Kabadi
1997 J jnl
Minimum Dispersion Problems.
Discret. Appl. Math.
Abraham P. Punnen, Yash P. Aneja
1996 J jnl
A Fast Algorithm for a Class of Bottleneck Problems.
Computing
Abraham P. Punnen
1996 J jnl
An Improved Algorithm for the Constrained Bottleneck Spanning Tree Problem.
INFORMS J. Comput.
Abraham P. Punnen, K. P. K. Nair
1996 J jnl
On k-sum optimization.
Oper. Res. Lett.
Abraham P. Punnen, Yash P. Aneja
1995 J jnl
Constrained Matroidal Bottleneck Problems.
Discret. Appl. Math.
Igor Averbakh, Oded Berman, Abraham P. Punnen
1994 J jnl
A Fast and Simple Algorithm for the Bottleneck Biconnected Spanning Subgraph Problem.
Inf. Process. Lett.
Abraham P. Punnen, Kunhiraman Nair
1994 J jnl
Improved Complexity Bound for the Maximum Cardinality Bottleneck Bipartite Matching Problem.
Discret. Appl. Math.
Abraham P. Punnen, Kunhiraman Nair
1994 J jnl
On combined minmax-minsum optimization.
Comput. Oper. Res.
Abraham P. Punnen
1993 J jnl
On: Travelling salesman problem under categorization: Operations Research Letters 12 (1992) 89-95.
Oper. Res. Lett.
Abraham P. Punnen
1992 J jnl
Minimum Perfect Bipartite Matchings and Spanning Trees under Categorization.
Discret. Appl. Math.
Michael B. Richey, Abraham P. Punnen
1992 J jnl
Traveling salesman problem under categorization.
Oper. Res. Lett.
Abraham P. Punnen