Library Hours
Monday to Friday: 9 a.m. to 9 p.m.
Saturday: 9 a.m. to 5 p.m.
Sunday: 1 p.m. to 9 p.m.
Naper Blvd. 1 p.m. to 5 p.m.
     
Limit search to available items
Results Page:  Previous Next

Title Applications of combinatorial optimization / edited by Vangelis Th. Paschos. [O'Reilly electronic resource]

Edition Revised and updated 2nd edition.
Publication Info. London : ISTE Ltd ; Hoboken, NJ : John Wiley & Sons, Inc., 2014.
QR Code
Description 1 online resource (1 volume) : illustrations
Series Mathematics and statistics series
Mathematics and statistics series (ISTE)
Bibliography Includes bibliographical references and index.
Contents Table of Contents; Title Page; Copyright; Preface; Chapter 1: Airline Crew Pairing Optimization; 1.1. Introduction; 1.2. Definition of the Problem; 1.3. Solution Approaches; 1.4. Solving the Subproblem for Column Generation; 1.5. Conclusion; 1.6. Bibliography; Chapter 2: The Task Allocation Problem; 2.1. Presentation; 2.2. Definitions and Modeling; 2.3. Review of the Main Works; 2.4. A Little-Studied Model; 2.5. Conclusion; 2.6. Bibliography; Chapter 3: A Comparison of Some Valid Inequality Generation Methods for General 0-1 Problems; 3.1. Introduction
3.2. Presentation of the Various Techniques Tested3.3. Computational Results; 3.4. Bibliography; Chapter 4: Production Planning; 4.1. Introduction; 4.2. Hierarchical Planning; 4.3. Strategic Planning and Productive System Design; 4.4. Tactical Planning and Inventory Management; 4.5. Operations Planning and Scheduling; 4.6. Conclusion and Perspectives; 4.7. Bibliography; Chapter 5: Operations Research and Goods Transportation; 5.1. Introduction; 5.2. Goods Transport Systems; 5.3. Systems Design; 5.4. Long-distance Transport; 5.5. Vehicle Routing Problems
5.6. Exact Models and Methods for the VRP5.7. Heuristic Methods for the VRP; 5.8. Conclusion; 5.9. Appendix: Metaheuristics; 5.10. Bibliography; Chapter 6: Optimization Models for Transportation Systems Planning; 6.1. Introduction; 6.2. Spatial Interaction Models; 6.3. Traffic Assignment Models and Methods; 6.4. Transit Route Choice Models; 6.5. Strategic Planning of Multimodal Systems; 6.6. Conclusion; 6.7. Bibliography; Chapter 7: A Model for the Design of a Minimum-cost Telecommunications Network; 7.1. Introduction; 7.2. Minimum Cost Network Construction
7.3. Mathematical Model, General Context7.4. Proposed Algorithm; 7.5. Critical Points; 7.6. Conclusion; 7.7. Bibliography; Chapter 8: Parallel Combinatorial Optimization; 8.1. Impact of parallelism in Combinatorial Optimization; 8.2. Parallel Metaheuristics; 8.3. Parallelizing Tree Exploration in Exact Methods; 8.4. Conclusion; 8.5. Bibliography; Chapter 9: Network Design Problems: Fundamental Methods; 9.1. Introduction; 9.2. The Main Mathematical and Algorithmic Tools for Network Design; 9.3. Models and Problems; 9.4. The Steiner-Extended problem; 9.5. Conclusion; 9.6 Bibliography
Chapter 10: Network Design Problems: Models and Applications10.1. Introduction; 10.2. Models and Location Problems; 10.3. Routing Models for Telecommunications; 10.4. The Design or Dimensioning Problem in Telecommunications; 10.5. Coupled Flows and Multiflows for Transport and Production; 10.6. A Mixed Network Pricing Model; 10.7. Conclusion; 10.8. Bibliography; Chapter 11: Multicriteria Task Allocation to Heterogenous Processors with Capacity and Mutual Exclusion Constraints; 11.1. Introduction and Formulation of the Problem; 11.2. Modeling the Set of Feasible Assignments
Summary Annotation Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management. The three volumes of the Combinatorial Optimization series aim to cover a wide range of topics in this area. These topics also deal with fundamental notions and approaches as with several classical applications of combinatorial optimization. "Concepts of Combinatorial Optimization," is divided into three parts: - On the complexity of combinatorial optimization problems, presenting basics about worst-case and randomized complexity; - Classical solution methods, presenting the two most-known methods for solving hard combinatorial optimization problems, that are Branch-and-Bound and Dynamic Programming; - Elements from mathematical programming, presenting fundamentals from mathematical programming based methods that are in the heart of Operations Research since the origins of this field."
Subject Combinatorial optimization.
Programming (Mathematics)
Optimisation combinatoire.
Programmation (Mathématiques)
Combinatorial optimization
Programming (Mathematics)
Added Author Paschos, Vangelis Th., editor.
Other Form: Print version: Optimisation combinatoire. English. Optimisation combinatoire. English. Revised and updated 2nd edition 9781848216563 (OCoLC)890186511
ISBN 9781119015246
1119015243
1848216580
9781848216587
Patron reviews: add a review
Click for more information
EBOOK
No one has rated this material

You can...
Also...
- Find similar reads
- Add a review
- Sign-up for Newsletter
- Suggest a purchase
- Can't find what you want?
More Information