Anzeige
Erschienen in:
1987 | OriginalPaper | Buchkapitel
Some Considerations about Computational Complexity for Multi Objective Combinatorial Problems
verfasst von : Paolo Serafini
Erschienen in: Recent Advances and Historical Development of Vector Optimization
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In the field of vector (or multi objective) optimization there has been a relatively little interest in solving combinatorial or discrete problems. During the 70’s just a few papers have been published on multi objective (m.o.) integer linear programming. However no special emphasis was put on the important aspect of computational complexity. This can be certainly ascribed to the fact that the theory of NP—completeness was developing at a fast pace in those same years.