Publication Date:
1986
abstract:
An outline of combinatorial optimization problems from the NP- completeness theory point of view is worked out. The importance of approximation algorithms is also stressed, and some results concerning the performance evaluation function, bin packing, and network flow equilibrium problems are presented.
Iris type:
04.01 Contributo in Atti di convegno
Keywords:
combinatorial optimization; NP-completeness; approximation algorithms; performance evaluation; bin packing; network flow equilibrium problems
List of contributors:
Aiello, Aldo; Burattini, Ernesto; MANGO FURNARI, Mario; Massarotti, Antonio; Ventriglia, Francesco
Book title:
Algebra, combinatorics and logic in computer science, Colloq. Math. Soc. János Bolyai
Published in: