Abstract
This monograph analyzes various classes of Boolean quadratic problems with special ordered set constraints (BQPSs) in order to develop a practical approach to solving these problems. The BQPS provides a framework of mathematical abstraction for a variety of scheduling, design and assignment problems with a combination of linear assignment and quadratic interaction cost, not necessarily nonnegative, that arise in a wide variety of real-life contexts. We start with a detailed discussion of quadratic assignment problems which appear to have their roots in three separate spheres of scientific interest — in spatial economics which has a long history of its own, see e.g. Weber [1909], and in industrial engineering and computer science, both of which are comparatively young disciplines.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1996 Kluwer Academic Publishers
About this chapter
Cite this chapter
Padberg, M., Rijal, M.P. (1996). Location Problems. In: Location, Scheduling, Design and Integer Programming. International Series in Operations Research & Management Science, vol 3. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1379-3_1
Download citation
DOI: https://doi.org/10.1007/978-1-4613-1379-3_1
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-8596-0
Online ISBN: 978-1-4613-1379-3
eBook Packages: Springer Book Archive