Abraham P. Punnen - Citas de Google Académico

Citado por

	Total	Desde 2014
Citas	4284	1851
Índice h	27	17
Índice i10	65	35

360

180

270

19961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201918 18 17 31 20 24 44 47 73 127 190 207 209 226 261 255 278 238 284 306 277 334 351 295

Coautores

G. GutinProfessor of Computer Science, Royal Holloway, University of LondonDirección de correo verificada de rhul.ac.uk
James B. OrlinProfessor, Massachusetts Institute of TechnologyDirección de correo verificada de mit.edu
Ravindra AhujaProfessor of Industrial & Systems Engineering at University of FloridaDirección de correo verificada de optym.com
Ozlem ErgunNortheastern UniversityDirección de correo verificada de neu.edu
Yash AnejaOdette School of Business, University of windsorDirección de correo verificada de uwindsor.ca
Daniel KarapetyanCSEE, University of EssexDirección de correo verificada de essex.ac.uk
Snezana Mitrovic-MinicSimon Fraser UniversityDirección de correo verificada de sfu.ca
Ruonan ZhangDepartment of Mathematical Sciences, Xi'an Jiaotong-Liverpool UniversityDirección de correo verificada de xjtlu.edu.cn
Ante ĆustićPostdoc in Mathematics and Computer Science, Simon Fraser UniversityDirección de correo verificada de sfu.ca
Krishna Teja MalladiPhD Candidate, Industrial Engineering Research Group, University of British ColumbiaDirección de correo verificada de alumni.ubc.ca
Fred GloverDistinguished Professor, University of Colorado & Chief Technology Officer, OptTek SystemsDirección de correo verificada de opttek.com
Andreas S. SchulzTechnische Universität MünchenDirección de correo verificada de tum.de
Yang WangSchool of Management, Northwestern Polytechnical UniversityDirección de correo verificada de nwpu.edu.cn
Nabil Belacel, Ph.D.Senior research officer at National Research Council of CanadaDirección de correo verificada de nrc.gc.ca
Brad WoodsPhD. Operations Research, Simon Fraser UniversityDirección de correo verificada de sfu.ca
P.. VellaisamyINdian Institute of Technology BombayDirección de correo verificada de math.iitb.ac.in
Andrew J ParkesSchool of Computer Science, University of NottinghamDirección de correo verificada de cs.nott.ac.uk
Binay BhattacharyyaDirección de correo verificada de cs.sfu.ca
Gary KochenbergerDirección de correo verificada de ucdenver.edu
Igor AverbakhUniversity of Toronto ScarboroughDirección de correo verificada de utsc.utoronto.ca

Abraham P. Punnen

Professor of Operations Research, Simon Fraser University

Dirección de correo verificada de sfu.ca - Página principal

Operations Research Combinatorial Optimization Approximation Algorithms Metaheuristics Transportation


Título	Citado por	Año
The traveling salesman problem and its variations G Gutin, AP Punnen Springer, 2002	1552*	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	751	2002
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	118	1997
Very large‐scale neighborhood search RK Ahuja, JB Orlin, D Sharma International Transactions in Operational Research 7 (4‐5), 301-317, 2000	111	2000
The traveling salesman problem: Applications, formulations and variations AP Punnen The traveling salesman problem and its variations, 1-28, 2007	92	2007
Approximate local search in combinatorial optimization JB Orlin, AP Punnen, AS Schulz SIAM Journal on Computing 33 (5), 1201-1214, 2004	89	2004
Learning multicriteria fuzzy classification method PROAFTN from data N Belacel, HB Raval, AP Punnen Computers & operations research 34 (7), 1885-1898, 2007	66	2007
TSP heuristics: domination analysis and complexity A Punnen, FS Margot, S Kabadi Algorithmica 35 (2), 111-127, 2003	59	2003
A linear time algorithm for the maximum capacity path problem AP Punnen European Journal of Operational Research 53 (3), 402-404, 1991	51	1991
Satellite downlink scheduling problem: A case study D Karapetyan, SM Minic, KT Malladi, AP Punnen Omega 53, 115-123, 2015	43*	2015
Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem AP Punnen, KPK Nair Discrete Applied Mathematics 55 (1), 91-93, 1994	42	1994
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	41*	2009
The traveling salesman problem: new polynomial approximation algorithms and domination analysis AP Punnen Journal of Information and Optimization Sciences 22 (1), 191-206, 2001	40	2001
The minimum spanning tree problem with conflict constraints and its variations R Zhang, SN Kabadi, AP Punnen Discrete Optimization 8 (2), 191-205, 2011	38	2011
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	37	2010
Domination analysis of some heuristics for the traveling salesman problem A Punnen, S Kabadi Discrete Applied Mathematics 119 (1-2), 117-128, 2002	37	2002
The traveling salesman problem G Gutin, A Punnen Discrete Optimization 3 (1), 1, 2006	35	2006
Categorized assignment scheduling: A tabu search approach AP Punnen, YP Aneja Journal of the Operational Research Society 44 (7), 673-679, 1993	35	1993
Traveling salesman problem under categorization AP Punnen Operations Research Letters 12 (2), 89-95, 1992	32	1992
A simplex algorithm for piecewise-linear fractional programming problems P Pandey, AP Punnen European Journal of Operational Research 178 (2), 343-358, 2007	30	2007

El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.

Artículos 1–20

Citas por año

Citas duplicadas

Citas combinadas

Añadir coautoresCoautores

Subir PDF

Seguir a este autor

Citado por

Coautores