Obserwuj
Abraham P. Punnen
Tytuł
Cytowane przez
Cytowane przez
Rok
The traveling salesman problem and its variations
G Gutin, AP Punnen
Springer, 2002
1925*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
9452002
The traveling salesman problem and its variations (Combinatorial Optimization)
G Gutin, AP Punnen
5972002
The traveling salesman problem: Applications, formulations and variations
AP Punnen
The traveling salesman problem and its variations, 1-28, 2007
1942007
Very large‐scale neighborhood search
RK Ahuja, JB Orlin, D Sharma
International Transactions in Operational Research 7 (4‐5), 301-317, 2000
1382000
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
1301997
Approximate local search in combinatorial optimization
JB Orlin, AP Punnen, AS Schulz
SIAM Journal on Computing 33 (5), 1201-1214, 2004
1222004
Satellite downlink scheduling problem: A case study
D Karapetyan, SM Minic, KT Malladi, AP Punnen
Omega 53, 115-123, 2015
98*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
842011
Learning multicriteria fuzzy classification method PROAFTN from data
N Belacel, HB Raval, AP Punnen
Computers & operations research 34 (7), 1885-1898, 2007
842007
TSP heuristics: domination analysis and complexity
A Punnen, FS Margot, S Kabadi
Algorithmica 35 (2), 111-127, 2003
782003
Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem
AP Punnen, KPK Nair
Discrete Applied Mathematics 55 (1), 91-93, 1994
741994
A linear time algorithm for the maximum capacity path problem
AP Punnen
European Journal of Operational Research 53 (3), 402-404, 1991
731991
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
552013
The quadratic unconstrained binary optimization problem
AP Punnen
Springer International Publishing 10, 978-3, 2022
502022
A simplex algorithm for piecewise-linear fractional programming problems
P Pandey, AP Punnen
European Journal of Operational Research 178 (2), 343-358, 2007
472007
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
462010
Categorized assignment scheduling: A tabu search approach
AP Punnen, YP Aneja
Journal of the Operational Research Society 44 (7), 673-679, 1993
461993
The traveling salesman problem: new polynomial approximation algorithms and domination analysis
AP Punnen
Journal of Information and Optimization Sciences 22 (1), 191-206, 2001
452001
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20