Location, Scheduling, Design and Integer Programming
Padberg, Manfred W.; Rijal, Minendra
ISBN 10: 1461285968 ISBN 13: 9781461285960
Editore: Springer-Verlag New York Inc., 2011
Nuovi
Brossura
Da
Kennys Bookstore, Olney, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Venditore AbeBooks dal 9 ottobre 2009
Questo articolo specifico non è più disponibile.
Riguardo questo articolo
Descrizione:
Series: International Series in Operations Research & Management Science. Num Pages: 220 pages, biography. BIC Classification: KJT; PBWH. Category: (P) Professional & Vocational. Dimension: 234 x 156 x 12. Weight in Grams: 364. . 2011. Softcover reprint of the original 1st ed. 1996. Paperback. . . . . Books ship from the US and Ireland. Codice articolo V9781461285960
Riassunto:
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.
Contenuti: Preface. 1. Location Problems. 2. Scheduling and Design Problems. 3. Solution Approaches. 4. Locally Ideal LP Formulations I. 5. Locally Ideal LP Formulations II. 6. Quadratic Scheduling Problems. 7. Quadratic Assignment Polytopes. 8. Solving Small QAPs. A. FORTRAN Programs for Small SQPs. References. Index.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Dati bibliografici
Titolo: Location, Scheduling, Design and Integer ...
Casa editrice: Springer-Verlag New York Inc.
Data di pubblicazione: 2011
Legatura: Brossura
Condizione: New
I migliori risultati di ricerca su AbeBooks
Immagini fornite dal venditore
Location, Scheduling, Design and Integer Programming
Da: moluna, Greven, Germania
Valutazione del venditore 4 su 5 stelle
Condizione: New. Codice articolo 4191161
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Location, Scheduling, Design and Integer Programming
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 18685700-n
Quantità: 15 disponibili
Foto dell'editore
Location, Scheduling, Design and Integer Programming (Paperback)
Editore:
Springer-Verlag New York Inc., New York, NY, 2011
ISBN 10: 1461285968
ISBN 13: 9781461285960
Nuovo
Paperback
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: new. Paperback. 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. This monograph focuses on a class of problems that in effect have yet to be solved. Location, scheduling and design problems are assignment type problems with quadratic cost functions and occur in many contexts. 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. Padberg and Rijal have taken an important step in the solution of these problems. In this monograph they classify mathematical properties for ten classes of assignment problems: Quadratic Assignment Problems, Traveling Salesman Problems, Triangulation Problems, Linear Assignment Problems, VLSI Circuit Layout Design Problems, Multi-Processor Problems, Scheduling Problems with Interaction Costs, Operation-Scheduling Problems, Graph and Clique Partitioning Problems, and Boolean Quadratic Problems. They note that before these problems can be solved computationally, one must know and understand their mathematical properties. After discussing these properties, an integer programming approach is offered for solving them. The computational approach has shown considerable algorithmic success. The heart of this monograph is the theoretical work on assignment problems and the computation results that were produced using algorithms developed at NYU. The authors conclude that implementing a proper branch-and-cut algorithm on these types of problems will push the limits of exact computation far beyond the current ones. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Codice articolo 9781461285960
Quantità: 1 disponibili
Foto dell'editore
Location, Scheduling, Design and Integer Programming (International Series in Operations Research & Management Science)
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo ABLIING23Mar2716030029854
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Location, Scheduling, Design and Integer Programming
Editore:
Springer US, Springer US Sep 2011, 2011
ISBN 10: 1461285968
ISBN 13: 9781461285960
Nuovo
Taschenbuch
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. Codice articolo 9781461285960
Quantità: 2 disponibili
Immagini fornite dal venditore
Location, Scheduling, Design and Integer Programming
Editore:
Springer US, Springer US Sep 2011, 2011
ISBN 10: 1461285968
ISBN 13: 9781461285960
Nuovo
Taschenbuch
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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 GmbH, Tiergartenstr. 17, 69121 Heidelberg 236 pp. Englisch. Codice articolo 9781461285960
Quantità: 1 disponibili
Foto dell'editore
Location, Scheduling, Design and Integer Programming (International Series in Operations Research & Management Science)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9781461285960_new
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Location, Scheduling, Design and Integer Programming
Editore:
Springer US, Springer US, 2011
ISBN 10: 1461285968
ISBN 13: 9781461285960
Nuovo
Taschenbuch
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. Codice articolo 9781461285960
Quantità: 1 disponibili
Foto dell'editore
Location, Scheduling, Design and Integer Programming
Da: Books Puddle, New York, NY, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New. pp. 236. Codice articolo 2648020373
Quantità: 4 disponibili
Foto dell'editore
Location, Scheduling, Design and Integer Programming
Print on DemandDa: Majestic Books, Hounslow, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. Print on Demand pp. 236 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam. Codice articolo 44762186
Quantità: 4 disponibili