default search action
Abraham P. Punnen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j83]Abraham P. Punnen, Jasdeep Dhahan
:
The Knapsack Problem with Conflict Pair Constraints on Bipartite Graphs and Extensions. Algorithms 17(5): 219 (2024) - [j82]Wei Yang
Experimental analysis of algorithms for the independent quadratic assignment problem. Comput. Oper. Res. 168: 106704 (2024) - [j81]Abraham P. Punnen, Navpreet Kaur:
Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations. Discret. Optim. 54: 100858 (2024) - [i23]Abraham P. Punnen, Navpreet Kaur:
Revisiting some classical linearizations of the quadratic binary optimization problem. CoRR abs/2404.09437 (2024) - 2023
- [j80]Yang Wang, Haichao Liu
A three-phase matheuristic algorithm for the multi-day task assignment problem. Comput. Oper. Res. 159: 106313 (2023) - [j79]Zhongxiang Chang
Solving dynamic satellite image data downlink scheduling problem via an adaptive bi-objective optimization algorithm. Comput. Oper. Res. 160: 106388 (2023) - 2022
- [j78]Piyashat Sripratak
The Bipartite Boolean Quadric Polytope. Discret. Optim. 44(Part): 100657 (2022) - [j77]Abraham P. Punnen, Renata Sotirov:
Preface: Quadratic combinatorial optimization problems. Discret. Optim. 44(Part): 100688 (2022) - [i22]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 abs/2207.00168 (2022) - [i21]Zhongxiang Chang, Abraham P. Punnen, Zhongbao Zhou:
Multi-strip observation scheduling problem for ac-tive-imaging agile earth observation satellites. CoRR abs/2207.01257 (2022) - 2021
- [j76]Yang Wang
A Fast and Robust Heuristic Algorithm for the Minimum Weight Vertex Cover Problem. IEEE Access 9: 31932-31945 (2021) - [j75]Yang Wang
The Rank-One Quadratic Assignment Problem. INFORMS J. Comput. 33(3): 979-996 (2021) - 2020
- [j74]Vladyslav Sokol
Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms. INFORMS J. Comput. 32(3): 730-746 (2020) - [j73]Brad D. Woods
A class of exponential neighbourhoods for the quadratic travelling salesman problem. J. Comb. Optim. 40(2): 303-332 (2020) - [j72]Bo Peng, Yuan Zhang, T. C. E. Cheng
A two-individual based path-relinking algorithm for the satellite broadcast scheduling problem. Knowl. Based Syst. 196: 105774 (2020)
2010 – 2019
- 2019
- [j71]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) - [j70]Stefan Lendl
Combinatorial optimization with interaction costs: Complexity and solvable cases. Discret. Optim. 33: 101-117 (2019) - [j69]Jiawei Song, Yang Wang, Haibo Wang
An effective multi-wave algorithm for solving the max-mean dispersion problem. J. Heuristics 25(4-5): 731-752 (2019) - 2018
- [j68]Ante Custic, Ruonan Zhang, Abraham P. Punnen:
The quadratic minimum spanning tree problem and its variations. Discret. Optim. 27: 73-87 (2018) - [j67]Pooja Pandey, Abraham P. Punnen:
The generalized vertex cover problem and some variations. Discret. Optim. 30: 121-143 (2018) - [j66]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: 284-300 (2018) - [j65]Ante Custic
A characterization of linearizable instances of the quadratic minimum spanning tree problem. J. Comb. Optim. 35(2): 436-453 (2018) - [p2]Ravindra K. Ahuja, Özlem Ergun, James B. Orlin, Abraham P. Punnen:
Very Large-Scale Neighborhood Search: Theory, Algrithms, and Applications. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 311-326 - [i20]Abraham P. Punnen, Pooja Pandey:
Representations of quadratic combinatorial optimization problems: A case study using the quadratic set covering problem. CoRR abs/1802.00897 (2018) - 2017
- [j64]Yang Wang, Abraham P. Punnen:
The boolean quadratic programming problem with generalized upper bound constraints. Comput. Oper. Res. 77: 1-10 (2017) - [j63]Krishna Teja Malladi
Clustered maximum weight clique problem: Algorithms and empirical analysis. Comput. Oper. Res. 85: 113-128 (2017) - [j62]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: 163-182 (2017) - [j61]Daniel Karapetyan
Markov Chain methods for the Bipartite Boolean Quadratic Programming Problem. Eur. J. Oper. Res. 260(2): 494-506 (2017) - [j60]Ante Custic
The bilinear assignment problem: complexity and polynomially solvable special cases. Math. Program. 166(1-2): 185-205 (2017) - [j59]Pooja Pandey, Abraham P. Punnen:
On a linearization technique for solving the quadratic set covering problem and variations. Optim. Lett. 11(7): 1357-1370 (2017) - [j58]Ante Custic
Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis. Oper. Res. Lett. 45(3): 232-237 (2017) - [i19]Brad D. Woods, Abraham P. Punnen:
A class of exponential neighbourhoods for the quadratic travelling salesman problem. CoRR abs/1705.05393 (2017) - [i18]Vladyslav Sokol, Ante Custic, Abraham P. Punnen, Binay Bhattacharya:
Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms. CoRR abs/1707.07057 (2017) - [i17]Pooja Pandey, Abraham P. Punnen:
The generalized vertex cover problem and some variations. CoRR abs/1708.03703 (2017) - [i16]Abraham P. Punnen, Brad D. Woods, Santosh N. Kabadi:
A characterization of Linearizable instances of the Quadratic Traveling Salesman Problem. CoRR abs/1708.07217 (2017) - 2016
- [j57]Abraham P. Punnen, Yang Wang:
The bipartite quadratic assignment problem and extensions. Eur. J. Oper. Res. 250(3): 715-725 (2016) - [j56]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): 471-476 (2016) - [i15]Ante Custic, Ruonan Zhang, Abraham P. Punnen:
The Quadratic Minimum Spanning Tree Problem and its Variations. CoRR abs/1603.04451 (2016) - [i14]Daniel Karapetyan, Abraham P. Punnen, Andrew J. Parkes:
Multi-component approach to the bipartite Boolean quadratic programming problem. CoRR abs/1605.02038 (2016) - 2015
- [j55]Abraham P. Punnen, Piyashat Sripratak, Daniel Karapetyan
The bipartite unconstrained 0-1 quadratic programming problem: Polynomially solvable cases. Discret. Appl. Math. 193: 1-10 (2015) - [j54]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): 697-707 (2015) - [j53]Abraham P. Punnen, Piyashat Sripratak, Daniel Karapetyan
Average value of solutions for the bipartite boolean quadratic programs and rounding algorithms. Theor. Comput. Sci. 565: 77-89 (2015) - [c5]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: 353-358 - [i13]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 abs/1504.02151 (2015) - [i12]Pooja Pandey, Abraham P. Punnen:
On a linearization technique for solving quadratic set covering problem and variations. CoRR abs/1509.06305 (2015) - [i11]Ante Custic, Abraham P. Punnen:
A characterization of linearizable instances of the quadratic minimum spanning tree problem. CoRR abs/1510.02197 (2015) - 2014
- [j52]John Larusic, Abraham P. Punnen:
The asymmetric bottleneck traveling salesman problem: Algorithms, complexity and empirical analysis. Comput. Oper. Res. 43: 20-35 (2014) - [j51]Abraham P. Punnen, Sara Taghipour, Daniel Karapetyan
The quadratic balanced optimization problem. Discret. Optim. 12: 47-60 (2014) - 2013
- [j50]Temel Öncan, Ruonan Zhang, Abraham P. Punnen:
The minimum cost perfect matching problem with conflict pair constraints. Comput. Oper. Res. 40(4): 920-930 (2013) - [j49]Santosh N. Kabadi, Abraham P. Punnen:
Spanning cactus of a graph: Existence, extension, optimization, and approximation. Discret. Appl. Math. 161(1-2): 167-175 (2013) - [j48]Abraham P. Punnen, Santosh N. Kabadi:
A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems. Discret. Optim. 10(3): 200-209 (2013) - [j47]Ruonan Zhang, Abraham P. Punnen:
Quadratic bottleneck knapsack problems. J. Heuristics 19(4): 573-589 (2013) - [j46]Daniel Karapetyan
A reduced integer programming model for the ferry scheduling problem. Public Transp. 4(3): 151-163 (2013) - [c4]Abraham P. Punnen, Piyashat Sripratak, Daniel Karapetyan
Domination Analysis of Algorithms for Bipartite Boolean Quadratic Programs. FCT 2013: 271-282 - [i10]Abraham P. Punnen, Piyashat Sripratak, Daniel Karapetyan:
Average value of solutions for the bipartite boolean quadratic programs and rounding algorithms. CoRR abs/1303.0160 (2013) - [i9]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 abs/1305.5610 (2013) - 2012
- [j45]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): 38-52 (2012) - [j44]Qiaoming Han, Abraham P. Punnen:
Strong and weak edges of a graph and linkages with the vertex cover problem. Discret. Appl. Math. 160(3): 197-203 (2012) - [j43]Abraham P. Punnen, Ruonan Zhang:
Analysis of an approximate greedy algorithm for the maximum edge clique partitioning problem. Discret. Optim. 9(3): 205-208 (2012) - [j42]John Larusic, Abraham P. Punnen, Eric Aubanel:
Experimental analysis of heuristics for the bottleneck traveling salesman problem. J. Heuristics 18(3): 473-503 (2012) - [i8]Daniel Karapetyan, Abraham P. Punnen:
A reduced integer programming model for the ferry scheduling problem. CoRR abs/1205.3757 (2012) - [i7]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 abs/1206.5503 (2012) - [i6]Daniel Karapetyan, Abraham P. Punnen:
Heuristic algorithms for the bipartite unconstrained 0-1 quadratic programming problem. CoRR abs/1210.3684 (2012) - [i5]Abraham P. Punnen, Piyashat Sripratak, Daniel Karapetyan:
The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases. CoRR abs/1212.3736 (2012) - [i4]Abraham P. Punnen, Sara Taghipour, Daniel Karapetyan, Bishnu Bhattacharyya:
The quadratic balanced optimization problem. CoRR abs/1212.4211 (2012) - 2011
- [j41]Santosh N. Kabadi, Abraham P. Punnen:
Trioid: A generalization of matroid and the associated polytope. Algorithmic Oper. Res. 6(1): 29-39 (2011) - [j40]John Larusic, Abraham P. Punnen:
The balanced traveling salesmanproblem. Comput. Oper. Res. 38(5): 868-875 (2011) - [j39]Ruonan Zhang, Santosh N. Kabadi, Abraham P. Punnen:
The minimum spanning tree problem with conflict constraints and its variations. Discret. Optim. 8(2): 191-205 (2011) - [j38]Lara Turner, Abraham P. Punnen, Yash P. Aneja, Horst W. Hamacher:
On generalized balanced optimization problems. Math. Methods Oper. Res. 73(1): 19-27 (2011) - [j37]Santosh N. Kabadi, Abraham P. Punnen:
An O(n4) Algorithm for the QAP Linearization Problem. Math. Oper. Res. 36(4): 754-761 (2011) - 2010
- [j36]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): 1762-1773 (2010) - [j35]Daniel K. Benvenuti, Abraham P. Punnen:
SC-Hamiltonian graphs and digraphs: New necessary conditions and their impacts. Discret. Math. 310(21): 2841-2846 (2010) - [j34]Daniel K. Benvenuti, Abraham P. Punnen:
SC-Hamiltonicity and Its Linkages with Strong Hamiltonicity of a Graph. SIAM J. Discret. Math. 23(4): 2035-2041 (2010) - [c3]Qiaoming Han, Abraham P. Punnen:
On the Approximability of the Vertex Cover and Related Problems. AAIM 2010: 161-169 - [p1]Snezana Mitrovic-Minic, Abraham P. Punnen:
Variable Intensity Local Search. Matheuristics 2010: 245-252
2000 – 2009
- 2009
- [j33]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): 370-377 (2009) - [j32]Abraham P. Punnen, Ruonan Zhang:
Bottleneck flows in unit capacity networks. Inf. Process. Lett. 109(6): 334-338 (2009) - [j31]Qiaoming Han, Abraham P. Punnen, Yinyu Ye:
An edge-reduction algorithm for the vertex cover problem. Oper. Res. Lett. 37(3): 181-186 (2009) - [c2]James B. Orlin
Integer Programming: Optimization and Evaluation Are Equivalent. WADS 2009: 519-529 - 2008
- [j30]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): 388-398 (2008) - [j29]Santosh N. Kabadi, Abraham P. Punnen:
A strongly polynomial simplex method for the linear fractional assignment problem. Oper. Res. Lett. 36(4): 402-407 (2008) - 2007
- [j28]Nabil Belacel
Learning multicriteria fuzzy classification method PROAFTN from data. Comput. Oper. Res. 34(7): 1885-1898 (2007) - [j27]Pooja Pandey, Abraham P. Punnen:
A simplex algorithm for piecewise-linear fractional programming problems. Eur. J. Oper. Res. 178(2): 343-358 (2007) - [r1]Özlem Ergun, Abraham P. Punnen, James B. Orlin, Ravindra K. Ahuja:
Very Large-Scale Neighborhood Search. Handbook of Approximation Algorithms and Metaheuristics 2007 - [i3]Qiaoming Han, Abraham P. Punnen:
On the approximability of the vertex cover and related problems. CoRR abs/0712.3333 (2007) - [i2]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 abs/0712.3335 (2007) - [i1]Abraham P. Punnen, Ruonan Zhang:
Bottleneck flows in networks. CoRR abs/0712.3858 (2007) - 2006
- [j26]Gregory Z. Gutin, Abraham P. Punnen:
The traveling salesman problem. Discret. Optim. 3(1): 1 (2006) - [j25]Olena Chapovska, Abraham P. Punnen:
Variations of the prize-collecting Steiner tree problem. Networks 47(4): 199-205 (2006) - [j24]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): 977-998 (2006) - 2005
- [j23]Abraham P. Punnen, Olena Chapovska:
The bottleneck k-MST. Inf. Process. Lett. 95(5): 512-517 (2005) - [j22]Abraham P. Punnen, Prabha Sharma, Chin Diew Lai
Preface. Adv. Decis. Sci. 9(2): 59-60 (2005) - [j21]Abraham P. Punnen:
Minmax strongly connected subgraphs with node penalties. Adv. Decis. Sci. 9(2): 107-111 (2005) - 2004
- [j20]Abraham P. Punnen:
On bottleneck assignment problems under categorization. Comput. Oper. Res. 31(1): 151-154 (2004) - [j19]Abraham P. Punnen, Yash P. Aneja:
Lexicographic balanced optimization problems. Oper. Res. Lett. 32(1): 27-30 (2004) - [j18]James B. Orlin
Approximate Local Search in Combinatorial Optimization. SIAM J. Comput. 33(5): 1201-1214 (2004) - [c1]James B. Orlin, Abraham P. Punnen, Andreas S. Schulz:
Approximate local search in combinatorial optimization. SODA 2004: 587-596 - 2003
- [j17]Abraham P. Punnen, François Margot, Santosh N. Kabadi:
TSP Heuristics: Domination Analysis and Complexity. Algorithmica 35(2): 111-127 (2003) - [j16]Santosh N. Kabadi, Abraham P. Punnen:
Weighted graphs with all Hamiltonian cycles of the same length. Discret. Math. 271(1-3): 129-139 (2003) - 2002
- [j15]Abraham P. Punnen, Santosh N. Kabadi:
Domination analysis of some heuristics for the traveling salesman problem. Discret. Appl. Math. 119(1-2): 117-128 (2002) - [j14]Ravindra K. Ahuja, Özlem Ergun, James B. Orlin
A survey of very large-scale neighborhood search techniques. Discret. Appl. Math. 123(1-3): 75-102 (2002)
1990 – 1999
- 1999
- [j13]Yash P. Aneja, Abraham P. Punnen:
Multiple bottleneck assignment problem. Eur. J. Oper. Res. 112(1): 167-173 (1999) - 1998
- [j12]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): 105-110 (1998) - 1997
- [j11]Abraham P. Punnen, Yash P. Aneja:
Minimum Dispersion Problems. Discret. Appl. Math. 75(1): 93-102 (1997) - 1996
- [j10]Abraham P. Punnen:
A Fast Algorithm for a Class of Bottleneck Problems. Computing 56(4): 397-401 (1996) - [j9]Abraham P. Punnen, K. P. K. Nair:
An Improved Algorithm for the Constrained Bottleneck Spanning Tree Problem. INFORMS J. Comput. 8(1): 41-44 (1996) - [j8]Abraham P. Punnen, Yash P. Aneja:
On k-sum optimization. Oper. Res. Lett. 18(5): 233-236 (1996) - 1995
- [j7]Igor Averbakh, Oded Berman, Abraham P. Punnen:
Constrained Matroidal Bottleneck Problems. Discret. Appl. Math. 63(3): 201-214 (1995) - 1994
- [j6]Abraham P. Punnen:
On combined minmax-minsum optimization. Comput. Oper. Res. 21(6): 707-716 (1994) - [j5]Abraham P. Punnen, Kunhiraman Nair:
Improved Complexity Bound for the Maximum Cardinality Bottleneck Bipartite Matching Problem. Discret. Appl. Math. 55(1): 91-93 (1994) - [j4]Abraham P. Punnen, Kunhiraman Nair:
A Fast and Simple Algorithm for the Bottleneck Biconnected Spanning Subgraph Problem. Inf. Process. Lett. 50(5): 283-286 (1994) - 1993
- [j3]Abraham P. Punnen:
On: Travelling salesman problem under categorization: Operations Research Letters 12 (1992) 89-95. Oper. Res. Lett. 14(2): 121 (1993) - 1992
- [j2]Michael B. Richey, Abraham P. Punnen:
Minimum Perfect Bipartite Matchings and Spanning Trees under Categorization. Discret. Appl. Math. 39(2): 147-153 (1992) - [j1]Abraham P. Punnen:
Traveling salesman problem under categorization. Oper. Res. Lett. 12(2): 89-95 (1992)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: