ISBN: 9780792397151 - Location, Scheduling, Design and Integer Programming (international Series in Operations Research & Management Science, 3) (14 results)

Condition: good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail.…

Condition: New.

Condition: As New. Unread book in perfect condition.

Gebunden. Condition: New.

Condition: New.

Condition: As New. Unread book in perfect condition.

Condition: New. This work looks at location, scheduling and design problems which are assignment type problems with quadratic cost functions and occur in many contexts. It classifies the mathematical properties of ten such assignment type problems and addresses computationally. Series: International Series in Operations Research & Management Science. Num Pages: 220 pages, biography. BIC Classification: KJT. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 234 x 156 x 14. Weight in Grams: 509. . 1996. Hardback. . . . .…

Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.…

Condition: New. pp. 236.

Condition: New. This work looks at location, scheduling and design problems which are assignment type problems with quadratic cost functions and occur in many contexts. It classifies the mathematical properties of ten such assignment type problems and addresses computationally. Series: International Series in Operations Research & Management Science. Num Pages: 220 pages, biography. BIC Classification: KJT. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 234 x 156 x 14. Weight in Grams: 509. . 1996. Hardback. . . . . Books ship from the US and Ireland.…

Buch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 236 pp. Englisch.…

Buch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 236 pp. Englisch.…

Condition: New. Print on Demand pp. 236 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam.

Condition: New. PRINT ON DEMAND pp. 236.