Anzeige
Erschienen in:
1999 | OriginalPaper | Buchkapitel
Covering and Assignment
Erschienen in: Integer Optimization by Local Search
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
This chapter investigates two integer optimization problems, radar surveillance and course assignment. For both problems, the 0-1 OIP encoding is straightforward. Structurally, the problems are extensions of set covering and generalized assignment, respectively. The first problem stems from an industrial project at the Swedish Institute for Computer Science (SICS), while the second problem arose from an operating application at the Universität des Saarlandes. Both studies in this chapter will focus on performance variation of integer local search and IP branch-and-bound with increasing problem size.