The independent quadratic assignment problem: complexity and polynomially solvable special cases - Ante Custic; Wei Yang; Yang Wang; Abraham P. Punnen (J. Comb. Optim., 2025)

The Knapsack Problem with Conflict Pair Constraints on Bipartite Graphs and Extensions - Abraham P. Punnen; Jasdeep Dhahan (Algorithms, 2024)

Experimental analysis of algorithms for the independent quadratic assignment problem - Wei Yang; Yang Wang; Ante Custic; Abraham P. Punnen (Comput. Oper. Res., 2024)

Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations - Abraham P. Punnen; Navpreet Kaur (Discret. Optim., 2024)

Revisiting some classical linearizations of the quadratic binary optimization problem - Abraham P. Punnen; Navpreet Kaur (CoRR, 2024)

A three-phase matheuristic algorithm for the multi-day task assignment problem - Yang Wang; Haichao Liu; Bo Peng; Haibo Wang; Abraham P. Punnen (Comput. Oper. Res., 2023)

Solving dynamic satellite image data downlink scheduling problem via an adaptive bi-objective optimization algorithm - Zhongxiang Chang; Abraham P. Punnen; Zhongbao Zhou; Shi Cheng (Comput. Oper. Res., 2023)

The Bipartite Boolean Quadric Polytope - Piyashat Sripratak; Abraham P. Punnen; Tamon Stephen (Discret. Optim., 2022)

Preface: Quadratic combinatorial optimization problems - Abraham P. Punnen; Renata Sotirov (Discret. Optim., 2022)

An adaptive bi-objective optimization algorithm for the satellite image data downlink scheduling problem considering request split - Zhongxiang Chang; Abraham P. Punnen; Zhongbao Zhou (CoRR, 2022)

Multi-strip observation scheduling problem for ac-tive-imaging agile earth observation satellites - Zhongxiang Chang; Abraham P. Punnen; Zhongbao Zhou (CoRR, 2022)

A Fast and Robust Heuristic Algorithm for the Minimum Weight Vertex Cover Problem - Yang Wang; Zhipeng Lü; Abraham P. Punnen (IEEE Access, 2021)

The Rank-One Quadratic Assignment Problem - Yang Wang; Wei Yang; Abraham P. Punnen; Jingbo Tian; Aihua Yin; Zhipeng Lü (INFORMS J. Comput., 2021)

Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms - Vladyslav Sokol; Ante Custic; Abraham P. Punnen; Binay Bhattacharya (INFORMS J. Comput., 2020)

A class of exponential neighbourhoods for the quadratic travelling salesman problem - Brad D. Woods; Abraham P. Punnen (J. Comb. Optim., 2020)

A two-individual based path-relinking algorithm for the satellite broadcast scheduling problem - Bo Peng; Yuan Zhang; T. C. E. Cheng; Zhipeng Lü; Abraham P. Punnen (Knowl. Based Syst., 2020)

Representations of quadratic combinatorial optimization problems: A case study using quadratic set covering and quadratic knapsack problems - Abraham P. Punnen; Pooja Pandey; Michael Friesen (Comput. Oper. Res., 2019)

Combinatorial optimization with interaction costs: Complexity and solvable cases - Stefan Lendl; Ante Custic; Abraham P. Punnen (Discret. Optim., 2019)

An effective multi-wave algorithm for solving the max-mean dispersion problem - Jiawei Song; Yang Wang; Haibo Wang; Qinghua Wu; Abraham P. Punnen (J. Heuristics, 2019)

The quadratic minimum spanning tree problem and its variations - Ante Custic; Ruonan Zhang; Abraham P. Punnen (Discret. Optim., 2018)

The generalized vertex cover problem and some variations - Pooja Pandey; Abraham P. Punnen (Discret. Optim., 2018)

Adaptive tabu search with strategic oscillation for the bipartite boolean quadratic programming problem with partitioned variables - Yang Wang; Qinghua Wu; Abraham P. Punnen; Fred W. Glover (Inf. Sci., 2018)

A characterization of linearizable instances of the quadratic minimum spanning tree problem - Ante Custic; Abraham P. Punnen (J. Comb. Optim., 2018)

Very Large-Scale Neighborhood Search: Theory, Algrithms, and Applications - Ravindra K. Ahuja; Özlem Ergun; James B. Orlin; Abraham P. Punnen (Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Volume 1: Methologies and Traditional Applications, 2018)

Representations of quadratic combinatorial optimization problems: A case study using the quadratic set covering problem - Abraham P. Punnen; Pooja Pandey (CoRR, 2018)

The boolean quadratic programming problem with generalized upper bound constraints - Yang Wang; Abraham P. Punnen (Comput. Oper. Res., 2017)

Clustered maximum weight clique problem: Algorithms and empirical analysis - Krishna Teja Malladi; Snezana Mitrovic-Minic; Abraham P. Punnen (Comput. Oper. Res., 2017)

A linear time algorithm for the -neighbour Travelling Salesman Problem on a Halin graph and extensions - Brad D. Woods; Abraham P. Punnen; Tamon Stephen (Discret. Optim., 2017)

Markov Chain methods for the Bipartite Boolean Quadratic Programming Problem - Daniel Karapetyan; Abraham P. Punnen; Andrew J. Parkes (Eur. J. Oper. Res., 2017)

The bilinear assignment problem: complexity and polynomially solvable special cases - Ante Custic; Vladyslav Sokol; Abraham P. Punnen; Binay Bhattacharya (Math. Program., 2017)

On a linearization technique for solving the quadratic set covering problem and variations - Pooja Pandey; Abraham P. Punnen (Optim. Lett., 2017)

Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis - Ante Custic; Abraham P. Punnen (Oper. Res. Lett., 2017)

A class of exponential neighbourhoods for the quadratic travelling salesman problem - Brad D. Woods; Abraham P. Punnen (CoRR, 2017)

Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms - Vladyslav Sokol; Ante Custic; Abraham P. Punnen; Binay Bhattacharya (CoRR, 2017)

The generalized vertex cover problem and some variations - Pooja Pandey; Abraham P. Punnen (CoRR, 2017)

A characterization of Linearizable instances of the Quadratic Traveling Salesman Problem - Abraham P. Punnen; Brad D. Woods; Santosh N. Kabadi (CoRR, 2017)

The bipartite quadratic assignment problem and extensions - Abraham P. Punnen; Yang Wang (Eur. J. Oper. Res., 2016)

Priority allocation rules for single machine total weighted linear and square tardiness problems - Aihua Yin; Abraham P. Punnen; Dongping Hu (Prod. Eng., 2016)

The Quadratic Minimum Spanning Tree Problem and its Variations - Ante Custic; Ruonan Zhang; Abraham P. Punnen (CoRR, 2016)

Multi-component approach to the bipartite Boolean quadratic programming problem - Daniel Karapetyan; Abraham P. Punnen; Andrew J. Parkes (CoRR, 2016)

The bipartite unconstrained 0-1 quadratic programming problem: Polynomially solvable cases - Abraham P. Punnen; Piyashat Sripratak; Daniel Karapetyan (Discret. Appl. Math., 2015)

Integrating tabu search and VLSN search to develop enhanced algorithms: A case study using bipartite boolean quadratic programs - Fred W. Glover; Tao Ye; Abraham P. Punnen; Gary A. Kochenberger (Eur. J. Oper. Res., 2015)

Average value of solutions for the bipartite boolean quadratic programs and rounding algorithms - Abraham P. Punnen; Piyashat Sripratak; Daniel Karapetyan (Theor. Comput. Sci., 2015)

A Network Model for the Hospital Routing Problem - Arash Rafiey; Vladyslav Sokol; Ramesh Krishnamurti; Snezana Mitrovic-Minic; Abraham P. Punnen; Krishna Teja Malladi (ICORES 2015 - Proceedings of the International Conference on Operations Research and Enterprise Systems, Lisbon, Portugal, 10-12 January, 2015, 2015)

A Linear Time Algorithm for the 3-Neighbour Traveling Salesman Problem on Halin graphs and extensions - Brad D. Woods; Abraham P. Punnen; Tamon Stephen (CoRR, 2015)

On a linearization technique for solving quadratic set covering problem and variations - Pooja Pandey; Abraham P. Punnen (CoRR, 2015)

A characterization of linearizable instances of the quadratic minimum spanning tree problem - Ante Custic; Abraham P. Punnen (CoRR, 2015)

The asymmetric bottleneck traveling salesman problem: Algorithms, complexity and empirical analysis - John Larusic; Abraham P. Punnen (Comput. Oper. Res., 2014)

The quadratic balanced optimization problem - Abraham P. Punnen; Sara Taghipour; Daniel Karapetyan; Bishnu Bhattacharyya (Discret. Optim., 2014)

The minimum cost perfect matching problem with conflict pair constraints - Temel Öncan; Ruonan Zhang; Abraham P. Punnen (Comput. Oper. Res., 2013)

Spanning cactus of a graph: Existence, extension, optimization, and approximation - Santosh N. Kabadi; Abraham P. Punnen (Discret. Appl. Math., 2013)

A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems - Abraham P. Punnen; Santosh N. Kabadi (Discret. Optim., 2013)

Quadratic bottleneck knapsack problems - Ruonan Zhang; Abraham P. Punnen (J. Heuristics, 2013)

A reduced integer programming model for the ferry scheduling problem - Daniel Karapetyan; Abraham P. Punnen (Public Transp., 2013)

Domination Analysis of Algorithms for Bipartite Boolean Quadratic Programs - Abraham P. Punnen; Piyashat Sripratak; Daniel Karapetyan (Fundamentals of Computation Theory - 19th International Symposium, FCT 2013, Liverpool, UK, August 19-21, 2013. Proceedings, 2013)

Average value of solutions for the bipartite boolean quadratic programs and rounding algorithms - Abraham P. Punnen; Piyashat Sripratak; Daniel Karapetyan (CoRR, 2013)

Integrating tabu search and VLSN search to develop enhanced algorithms: A case study using bipartite boolean quadratic programs - Fred W. Glover; Tao Ye; Abraham P. Punnen; Gary A. Kochenberger (CoRR, 2013)

Three value TSP and linkages with the three value linear spanning 2-forests - Daniel K. Benvenuti; Abraham P. Punnen (Discret. Appl. Math., 2012)

Strong and weak edges of a graph and linkages with the vertex cover problem - Qiaoming Han; Abraham P. Punnen (Discret. Appl. Math., 2012)

Analysis of an approximate greedy algorithm for the maximum edge clique partitioning problem - Abraham P. Punnen; Ruonan Zhang (Discret. Optim., 2012)

Experimental analysis of heuristics for the bottleneck traveling salesman problem - John Larusic; Abraham P. Punnen; Eric Aubanel (J. Heuristics, 2012)

A reduced integer programming model for the ferry scheduling problem - Daniel Karapetyan; Abraham P. Punnen (CoRR, 2012)

An ejection-chain heuristic for the satellite downlink scheduling problem: A case study with RADARSAT-2 - Daniel Karapetyan; Krishna T. Malladi; Snezana Mitrovic-Minic; Abraham P. Punnen (CoRR, 2012)

Heuristic algorithms for the bipartite unconstrained 0-1 quadratic programming problem - Daniel Karapetyan; Abraham P. Punnen (CoRR, 2012)

The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases - Abraham P. Punnen; Piyashat Sripratak; Daniel Karapetyan (CoRR, 2012)

The quadratic balanced optimization problem - Abraham P. Punnen; Sara Taghipour; Daniel Karapetyan; Bishnu Bhattacharyya (CoRR, 2012)

Trioid: A generalization of matroid and the associated polytope - Santosh N. Kabadi; Abraham P. Punnen (Algorithmic Oper. Res., 2011)

The balanced traveling salesmanproblem - John Larusic; Abraham P. Punnen (Comput. Oper. Res., 2011)

The minimum spanning tree problem with conflict constraints and its variations - Ruonan Zhang; Santosh N. Kabadi; Abraham P. Punnen (Discret. Optim., 2011)

On generalized balanced optimization problems - Lara Turner; Abraham P. Punnen; Yash P. Aneja; Horst W. Hamacher (Math. Methods Oper. Res., 2011)

An O(n\(^4\)) Algorithm for the QAP Linearization Problem - Santosh N. Kabadi; Abraham P. Punnen (Math. Oper. Res., 2011)

The quadratic minimum spanning tree problem: A lower bounding procedure and an efficient search algorithm - Temel Öncan; Abraham P. Punnen (Comput. Oper. Res., 2010)

SC-Hamiltonian graphs and digraphs: New necessary conditions and their impacts - Daniel K. Benvenuti; Abraham P. Punnen (Discret. Math., 2010)

SC-Hamiltonicity and Its Linkages with Strong Hamiltonicity of a Graph - Daniel K. Benvenuti; Abraham P. Punnen (SIAM J. Discret. Math., 2010)

On the Approximability of the Vertex Cover and Related Problems - Qiaoming Han; Abraham P. Punnen (Algorithmic Aspects in Information and Management, 6th International Conference, AAIM 2010, Weihai, China, July 19-21, 2010. Proceedings, 2010)

Variable Intensity Local Search - Snezana Mitrovic-Minic; Abraham P. Punnen (Matheuristics - Hybridizing Metaheuristics and Mathematical Programming, 2010)

Local search intensified: Very large-scale variable neighborhood search for the multi-resource generalized assignment problem - Snezana Mitrovic-Minic; Abraham P. Punnen (Discret. Optim., 2009)

Bottleneck flows in unit capacity networks - Abraham P. Punnen; Ruonan Zhang (Inf. Process. Lett., 2009)

An edge-reduction algorithm for the vertex cover problem - Qiaoming Han; Abraham P. Punnen; Yinyu Ye (Oper. Res. Lett., 2009)

Integer Programming: Optimization and Evaluation Are Equivalent - James B. Orlin; Abraham P. Punnen; Andreas S. Schulz (Algorithms and Data Structures, 11th International Symposium, WADS 2009, Banff, Canada, August 21-23, 2009. Proceedings, 2009)

VLSN search algorithms for partitioning problems using matching neighbourhoods - Temel Öncan; Santosh N. Kabadi; K. P. K. Nair; Abraham P. Punnen (J. Oper. Res. Soc., 2008)

A strongly polynomial simplex method for the linear fractional assignment problem - Santosh N. Kabadi; Abraham P. Punnen (Oper. Res. Lett., 2008)

Learning multicriteria fuzzy classification method PROAFTN from data - Nabil Belacel; Hiral Bhasker Raval; Abraham P. Punnen (Comput. Oper. Res., 2007)

A simplex algorithm for piecewise-linear fractional programming problems - Pooja Pandey; Abraham P. Punnen (Eur. J. Oper. Res., 2007)

Very Large-Scale Neighborhood Search - Özlem Ergun; Abraham P. Punnen; James B. Orlin; Ravindra K. Ahuja (Handbook of Approximation Algorithms and Metaheuristics, 2007)

On the approximability of the vertex cover and related problems - Qiaoming Han; Abraham P. Punnen (CoRR, 2007)

A polynomial time \frac 3 2 -approximation algorithm for the vertex cover problem on a class of graphs - Qiaoming Han; Abraham P. Punnen; Yinyu Ye (CoRR, 2007)

Bottleneck flows in networks - Abraham P. Punnen; Ruonan Zhang (CoRR, 2007)

The traveling salesman problem - Gregory Z. Gutin; Abraham P. Punnen (Discret. Optim., 2006)

Variations of the prize-collecting Steiner tree problem - Olena Chapovska; Abraham P. Punnen (Networks, 2006)

On cost matrices with two and three distinct values of Hamiltonian paths and cycles - Santosh N. Kabadi; Abraham P. Punnen (SIAM J. Discret. Math., 2006)

The bottleneck k-MST - Abraham P. Punnen; Olena Chapovska (Inf. Process. Lett., 2005)

Preface - Abraham P. Punnen; Prabha Sharma; Chin Diew Lai; Mahyar A. Amouzegar (Adv. Decis. Sci., 2005)

Minmax strongly connected subgraphs with node penalties - Abraham P. Punnen (Adv. Decis. Sci., 2005)

On bottleneck assignment problems under categorization - Abraham P. Punnen (Comput. Oper. Res., 2004)

Lexicographic balanced optimization problems - Abraham P. Punnen; Yash P. Aneja (Oper. Res. Lett., 2004)

Approximate Local Search in Combinatorial Optimization - James B. Orlin; Abraham P. Punnen; Andreas S. Schulz (SIAM J. Comput., 2004)

Approximate local search in combinatorial optimization - James B. Orlin; Abraham P. Punnen; Andreas S. Schulz (Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004, 2004)

TSP Heuristics: Domination Analysis and Complexity - Abraham P. Punnen; François Margot; Santosh N. Kabadi (Algorithmica, 2003)

Weighted graphs with all Hamiltonian cycles of the same length - Santosh N. Kabadi; Abraham P. Punnen (Discret. Math., 2003)

Domination analysis of some heuristics for the traveling salesman problem - Abraham P. Punnen; Santosh N. Kabadi (Discret. Appl. Math., 2002)

A survey of very large-scale neighborhood search techniques - Ravindra K. Ahuja; Özlem Ergun; James B. Orlin; Abraham P. Punnen (Discret. Appl. Math., 2002)

Multiple bottleneck assignment problem - Yash P. Aneja; Abraham P. Punnen (Eur. J. Oper. Res., 1999)

A Linear Time Algorithm for the Bottleneck Traveling Salesman Problem on a Halin Graph - Jeffrey Mark Phillips; Abraham P. Punnen; Santosh N. Kabadi (Inf. Process. Lett., 1998)

Minimum Dispersion Problems - Abraham P. Punnen; Yash P. Aneja (Discret. Appl. Math., 1997)

A Fast Algorithm for a Class of Bottleneck Problems - Abraham P. Punnen (Computing, 1996)

An Improved Algorithm for the Constrained Bottleneck Spanning Tree Problem - Abraham P. Punnen; K. P. K. Nair (INFORMS J. Comput., 1996)

On k-sum optimization - Abraham P. Punnen; Yash P. Aneja (Oper. Res. Lett., 1996)

Constrained Matroidal Bottleneck Problems - Igor Averbakh; Oded Berman; Abraham P. Punnen (Discret. Appl. Math., 1995)

On combined minmax-minsum optimization - Abraham P. Punnen (Comput. Oper. Res., 1994)

Improved Complexity Bound for the Maximum Cardinality Bottleneck Bipartite Matching Problem - Abraham P. Punnen; Kunhiraman Nair (Discret. Appl. Math., 1994)

A Fast and Simple Algorithm for the Bottleneck Biconnected Spanning Subgraph Problem - Abraham P. Punnen; Kunhiraman Nair (Inf. Process. Lett., 1994)

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

Minimum Perfect Bipartite Matchings and Spanning Trees under Categorization - Michael B. Richey; Abraham P. Punnen (Discret. Appl. Math., 1992)

Traveling salesman problem under categorization - Abraham P. Punnen (Oper. Res. Lett., 1992)