Abraham P. Punnen

Citata da

	Tutte	Dal 2019
Citazioni	6097	1948
Indice H	29	18
i10-index	83	39

360

180

270

1996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202422 18 15 31 19 27 44 47 64 147 193 217 212 228 275 267 275 253 300 341 283 336 347 352 325 288 359 288 335

Accesso pubblico

Visualizza tutto

20 articoli

9 articoli

Disponibili

Non disponibili

In base ai mandati di finanziamento

Coautori

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

Segui

Abraham P. Punnen

Professor of Operations Research, Simon Fraser University

Email verificata su sfu.ca - Home page

Operations Research Combinatorial Optimization Approximation Algorithms Metaheuristics Transportation


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
The traveling salesman problem and its variations G Gutin, AP Punnen Springer, 2002	2282*	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	931	2002
The traveling salesman problem: Applications, formulations and variations AP Punnen The traveling salesman problem and its variations, 1-28, 2007	175	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	117	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	71	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 traveling salesman problem: new polynomial approximation algorithms and domination analysis AP Punnen Journal of Information and Optimization Sciences 22 (1), 191-206, 2001	46	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
The quadratic unconstrained binary optimization problem AP Punnen Springer International Publishing 10, 978-3, 2022	44	2022
Domination analysis of some heuristics for the traveling salesman problem A Punnen, S Kabadi Discrete Applied Mathematics 119 (1-2), 117-128, 2002	42	2002

Il sistema al momento non può eseguire l'operazione. Riprova più tardi.

Articoli 1–20

Citazioni per anno

Citazioni duplicate

Citazioni unite

Aggiungi coautoriCoautori

Segui

Citata da

Coautori