Location, scheduling, design and integer programming (Q1352556)

From MaRDI portal
Revision as of 03:02, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Location, scheduling, design and integer programming
scientific article

    Statements

    Location, scheduling, design and integer programming (English)
    0 references
    0 references
    0 references
    16 February 1997
    0 references
    Location, scheduling and design problems are assignment type problems with quadratic cost functions. The area of their applications is stretching from spatial economics via plant and office layout planning to VLSI design problems in high-technology production settings. The presence of nonlinear interaction terms in the objective function makes these, otherwise simple, problems NP hard. The monograph provides first a survey of models of this type and gives a common framework for them as Boolean quadratic problems with special ordered sets (BQPSs). This survey is followed by a review of traditional solution approaches to BQPSs. In the main part of the book, the authors follow the polyhedral approach to combinatorial problem solving because of acknowledged algorithmic advantages of this approach. The book includes Fortran programs for small symmetric quadratic assignment problems.
    0 references
    location
    0 references
    scheduling
    0 references
    design problems
    0 references
    layout planning
    0 references
    VLSI design
    0 references
    quadratic assignment problems
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references