Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Editor information
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(1999). Covering and Assignment. In: Walser, J.P. (eds) Integer Optimization by Local Search. Lecture Notes in Computer Science(), vol 1637. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48369-1_6
Download citation
DOI: https://doi.org/10.1007/3-540-48369-1_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66367-6
Online ISBN: 978-3-540-48369-4
eBook Packages: Springer Book Archive