Abraham P. Punnen

Cited by

	All	Since 2019
Citations	6111	1966
h-index	29	18
i10-index	83	39

360

180

270

1996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420 18 15 31 19 26 44 47 64 147 193 217 212 228 275 267 275 252 300 341 283 336 347 352 325 288 359 286 355

Public access

View all

21 articles

9 articles

available

not available

Based on funding mandates

Co-authors

James B. OrlinProfessor, Massachusetts Institute of TechnologyVerified email at mit.edu
G. GutinProfessor of Computer Science, Royal Holloway, University of LondonVerified email at rhul.ac.uk
Ravindra AhujaProfessor of Industrial & Systems Engineering at University of FloridaVerified email at optym.com
Daniel KarapetyanSchool of Computer Science, University of NottinghamVerified email at nottingham.ac.uk
Ozlem ErgunNortheastern UniversityVerified email at neu.edu
Snezana Mitrovic-MinicSimon Fraser UniversityVerified email at sfu.ca
Yash AnejaOdette School of Business, University of windsorVerified email at uwindsor.ca
Ruonan ZhangDepartment of Mathematical Sciences, Xi'an Jiaotong-Liverpool UniversityVerified email at xjtlu.edu.cn
Krishna Teja MalladiPhD (Operations Research), Intel CorporationVerified email at alumni.ubc.ca
Ante ĆustićPostdoc in Mathematics and Computer Science, Simon Fraser UniversityVerified email at sfu.ca
Yang WangSchool of Management, Northwestern Polytechnical UniversityVerified email at nwpu.edu.cn
Fred GloverDistinguished Professor, University of Colorado & Chief Scientific Officer, Entanglement, Inc.Verified email at entanglement.ai
Andreas S. SchulzTechnische Universität MünchenVerified email at tum.de
Brad WoodsPhD. Operations Research, Simon Fraser UniversityVerified email at sfu.ca
Vladyslav Sokolsilo.aiVerified email at silo.ai
Gary KochenbergerUniversity of Colorado at DenverVerified email at ucdenver.edu
Andrew J ParkesSchool of Computer Science, University of NottinghamVerified email at cs.nott.ac.uk
Nabil Belacel, Ph.D.National Research Council of CanadaVerified email at nrc.gc.ca
P. VellaisamyIndian Institute of Technology BombayVerified email at math.iitb.ac.in
Binay BhattacharyyaVerified email at cs.sfu.ca

Abraham P. Punnen

Professor of Operations Research, Simon Fraser University

Verified email at sfu.ca - Homepage

Operations Research Combinatorial Optimization Approximation Algorithms Metaheuristics Transportation


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
The traveling salesman problem and its variations G Gutin, AP Punnen Springer, 2002	2286*	2002
A survey of very large-scale neighborhood search techniques RK Ahuja, Ö Ergun, JB Orlin, AP Punnen Discrete Applied Mathematics 123 (1-3), 75-102, 2002	933	2002
The traveling salesman problem: Applications, formulations and variations AP Punnen The traveling salesman problem and its variations, 1-28, 2007	176	2007
Very large‐scale neighborhood search RK Ahuja, JB Orlin, D Sharma International Transactions in Operational Research 7 (4‐5), 301-317, 2000	136	2000
The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms F Glover, AP Punnen Journal of the Operational Research Society 48 (5), 502-510, 1997	130	1997
Approximate local search in combinatorial optimization JB Orlin, AP Punnen, AS Schulz SIAM Journal on Computing 33 (5), 1201-1214, 2004	118	2004
Satellite downlink scheduling problem: A case study D Karapetyan, SM Minic, KT Malladi, AP Punnen Omega 53, 115-123, 2015	97*	2015
Learning multicriteria fuzzy classification method PROAFTN from data N Belacel, HB Raval, AP Punnen Computers & operations research 34 (7), 1885-1898, 2007	84	2007
The minimum spanning tree problem with conflict constraints and its variations R Zhang, SN Kabadi, AP Punnen Discrete Optimization 8 (2), 191-205, 2011	78	2011
TSP heuristics: domination analysis and complexity A Punnen, FS Margot, S Kabadi Algorithmica 35 (2), 111-127, 2003	78	2003
Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem AP Punnen, KPK Nair Discrete Applied Mathematics 55 (1), 91-93, 1994	73	1994
A linear time algorithm for the maximum capacity path problem AP Punnen European Journal of Operational Research 53 (3), 402-404, 1991	72	1991
Local search intensified: Very large-scale variable neighborhood search for the multi-resource generalized assignment problem S Mitrović-Minić, AP Punnen Discrete Optimization 6 (4), 370-377, 2009	70*	2009
The minimum cost perfect matching problem with conflict pair constraints T Öncan, R Zhang, AP Punnen Computers & Operations Research 40 (4), 920-930, 2013	50	2013
A simplex algorithm for piecewise-linear fractional programming problems P Pandey, AP Punnen European Journal of Operational Research 178 (2), 343-358, 2007	47	2007
The quadratic minimum spanning tree problem: A lower bounding procedure and an efficient search algorithm T Öncan, AP Punnen Computers & Operations Research 37 (10), 1762-1773, 2010	46	2010
The quadratic unconstrained binary optimization problem AP Punnen Springer International Publishing 10, 978-3, 2022	45	2022
The traveling salesman problem: new polynomial approximation algorithms and domination analysis AP Punnen Journal of Information and Optimization Sciences 22 (1), 191-206, 2001	45	2001
Categorized assignment scheduling: A tabu search approach AP Punnen, YP Aneja Journal of the Operational Research Society 44 (7), 673-679, 1993	45	1993
Minimum deviation problems SK Gupta, AP Punnen Operations research letters 7 (4), 201-204, 1988	44	1988

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors