Abraham P. Punnen

Получаване на мой собствен потребителски профил

Позовавания

	Всички	От 2020
Позовавания	6386	1755
h-индекс	30	17
i10-индекс	83	33

420

210

105

315

19961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202522 18 15 31 19 27 47 48 72 151 195 225 224 235 282 265 289 253 314 349 282 359 370 360 354 297 365 299 403 37

Публичен достъп

Преглед на всички

22 статии

8 статии

налични

неналични

Въз основа на изисквания при финансирането

Съавтори

James B. OrlinProfessor, Massachusetts Institute of TechnologyПотвърден имейл адрес: mit.edu
G. GutinProfessor of Computer Science, Royal Holloway, University of LondonПотвърден имейл адрес: rhul.ac.uk
Ravindra AhujaProfessor of Industrial & Systems Engineering at University of FloridaПотвърден имейл адрес: optym.com
Daniel KarapetyanSchool of Computer Science, University of NottinghamПотвърден имейл адрес: nottingham.ac.uk
Ozlem ErgunNortheastern UniversityПотвърден имейл адрес: neu.edu
Snezana Mitrovic-MinicSimon Fraser UniversityПотвърден имейл адрес: sfu.ca
Yash AnejaOdette School of Business, University of windsorПотвърден имейл адрес: uwindsor.ca
Ruonan ZhangDepartment of Mathematical Sciences, Xi'an Jiaotong-Liverpool UniversityПотвърден имейл адрес: xjtlu.edu.cn
Krishna Teja MalladiPhD (Operations Research), Intel CorporationПотвърден имейл адрес: alumni.ubc.ca
Ante ĆustićPostdoc in Mathematics and Computer Science, Simon Fraser UniversityПотвърден имейл адрес: sfu.ca
Yang WangSchool of Management, Northwestern Polytechnical UniversityПотвърден имейл адрес: nwpu.edu.cn
Fred GloverDistinguished Professor, University of Colorado & Chief Scientific Officer, Entanglement, Inc.Потвърден имейл адрес: entanglement.ai
Andreas S. SchulzTechnische Universität MünchenПотвърден имейл адрес: tum.de
Brad WoodsPhD. Operations Research, Simon Fraser UniversityПотвърден имейл адрес: sfu.ca
Vladyslav SokolAMDПотвърден имейл адрес: amd.com
Andrew J ParkesSchool of Computer Science, University of NottinghamПотвърден имейл адрес: cs.nott.ac.uk
Gary KochenbergerUniversity of Colorado at DenverПотвърден имейл адрес: ucdenver.edu
Nabil Belacel, Ph.D.National Research Council of CanadaПотвърден имейл адрес: nrc.gc.ca
P. VellaisamyIndian Institute of Technology BombayПотвърден имейл адрес: math.iitb.ac.in
Binay BhattacharyyaПотвърден имейл адрес: cs.sfu.ca

Следене

Abraham P. Punnen

Professor of Operations Research, Simon Fraser University

Потвърден имейл адрес: sfu.ca - Начална страница

Operations Research Combinatorial Optimization Approximation Algorithms Metaheuristics Transportation


Заглавие Сортиране по цитати Сортиране по година Сортиране по заглавие	Позовавания Позовавания	Година
The traveling salesman problem and its variations G Gutin, AP Punnen Springer, 2002	1922*	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	945	2002
The traveling salesman problem and its variations (Combinatorial Optimization) G Gutin, AP Punnen	595	2002
The traveling salesman problem: Applications, formulations and variations AP Punnen The traveling salesman problem and its variations, 1-28, 2007	192	2007
Very large‐scale neighborhood search RK Ahuja, JB Orlin, D Sharma International Transactions in Operational Research 7 (4‐5), 301-317, 2000	137	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	121	2004
Satellite downlink scheduling problem: A case study D Karapetyan, SM Minic, KT Malladi, AP Punnen Omega 53, 115-123, 2015	96*	2015
The minimum spanning tree problem with conflict constraints and its variations R Zhang, SN Kabadi, AP Punnen Discrete Optimization 8 (2), 191-205, 2011	84	2011
Learning multicriteria fuzzy classification method PROAFTN from data N Belacel, HB Raval, AP Punnen Computers & operations research 34 (7), 1885-1898, 2007	84	2007
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	74	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	71*	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	55	2013
The quadratic unconstrained binary optimization problem AP Punnen Springer International Publishing 10, 978-3, 2022	50	2022
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
Categorized assignment scheduling: A tabu search approach AP Punnen, YP Aneja Journal of the Operational Research Society 44 (7), 673-679, 1993	46	1993
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

Системата не може да изпълни операцията сега. Опитайте отново по-късно.

Статии 1–20

Позовавания годишно

Дублирани описания

Обединени библиографски описания

Добавяне на съавториСъавтори

Следене

Позовавания

Съавтори