Efficiently solvable special cases of hard combinatorial optimization problems

Data:	1997
Resum:	We survey some recent advances in the field of polynomially solvable special cases of hard combinatorial optimization problems like the travelling salesman problem, quadratic assignment problems and Steiner tree problems. Such special cases can be found by considering special cost structures, the geometry of the problem, the special topology of the underlying graph structure or by analyzing special algorithms. In particular we stress the importance of recognition algorithms. We comment on open problems in this area and outline some lines for future research in this field. .
Drets:	Tots els drets reservats.
Llengua:	Anglès
Document:	Article ; recerca ; Versió publicada
Matèria:	Travelling salesman problem ; Quadratic assignment problem ; Steiner tree problem ; Special case ; Polynomially solvable case
Publicat a:	Mathematical Programming, vol. 79 n. 1-3 (1997) p. 55-69, ISSN 0025-5610

15 p, 845.3 KB

Accés restringit a la UAB

Registre creat el 2006-03-13, darrera modificació el 2023-06-03