© 1996

Location, Scheduling, Design and Integer Programming


Part of the International Series in Operations Research & Management Science book series (ISOR, volume 3)

Table of contents

  1. Front Matter
    Pages i-xi
  2. Manfred Padberg, Minendra P. Rijal
    Pages 1-34
  3. Manfred Padberg, Minendra P. Rijal
    Pages 35-58
  4. Manfred Padberg, Minendra P. Rijal
    Pages 59-78
  5. Manfred Padberg, Minendra P. Rijal
    Pages 79-104
  6. Manfred Padberg, Minendra P. Rijal
    Pages 105-131
  7. Manfred Padberg, Minendra P. Rijal
    Pages 133-150
  8. Manfred Padberg, Minendra P. Rijal
    Pages 151-166
  9. Manfred Padberg, Minendra P. Rijal
    Pages 167-171
  10. Back Matter
    Pages 173-220

About this book


Location, scheduling and design problems are assignment type problems with quadratic cost functions and occur in many contexts stretching from spatial economics via plant and office layout planning to VLSI design and similar prob­ lems in high-technology production settings. The presence of nonlinear inter­ action terms in the objective function makes these, otherwise simple, problems NP hard. In the first two chapters of this monograph we provide a survey of models of this type and give a common framework for them as Boolean quadratic problems with special ordered sets (BQPSs). Special ordered sets associated with these BQPSs are of equal cardinality and either are disjoint as in clique partitioning problems, graph partitioning problems, class-room scheduling problems, operations-scheduling problems, multi-processor assign­ ment problems and VLSI circuit layout design problems or have intersections with well defined joins as in asymmetric and symmetric Koopmans-Beckmann problems and quadratic assignment problems. Applications of these problems abound in diverse disciplines, such as anthropology, archeology, architecture, chemistry, computer science, economics, electronics, ergonomics, marketing, operations management, political science, statistical physics, zoology, etc. We then give a survey of the traditional solution approaches to BQPSs. It is an unfortunate fact that even after years of investigation into these problems, the state of algorithmic development is nowhere close to solving large-scale real­ life problems exactly. In the main part of this book we follow the polyhedral approach to combinatorial problem solving because of the dramatic algorith­ mic successes of researchers who have pursued this approach.


STATISTICA Triangulation algorithm algorithms electronics linear optimization programming scheduling

Authors and affiliations

  1. 1.New York UniversityNew YorkUSA
  2. 2.Tribhuvan UniversityKathmanduNepal

Bibliographic information

Industry Sectors
Consumer Packaged Goods
Finance, Business & Banking
Energy, Utilities & Environment