Applications of combinatorial optimization
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 t…
Read More ↓Title Statements
- Full title :Applications of combinatorial optimization / edited by Vangelis Th. Paschos.
Summary
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 randomi.
Read More ↓Edition Statements
- Publication Date:©2014
- Edition:Revised and updated second edition
Publication Statements
The Physical Object
- Description:1 online resource (449 pages)
Edition Identifiers
- ISBN:9781119015222, 1119015227, 1848216580, 9781848216587
- oclc:ocn891381663
- LC Classification:QA402.5
- Dewey Decimal:519.64
Table of Contents
Cover; Title Page; Copyright; Contents; Preface; Chapter 1: Airline Crew Pairing Optimization; 1.1. Introduction; 1.2. Definition of the problem; 1.2.1. Constructing subnetworks; 1.2.2. Pairing costs; 1.2.3. Model; 1.2.4. Case without resource constraints; 1.3. Solution approaches; 1.3.1. Decomposition principles; 1.3.2. Column generation, master problem and subproblem; 1.3.3. Branching methods for finding integer solutions; 1.4. Solving the subproblem for column generation; 1.4.1. Mathematical formulation; 1.4.2. General principle of effective label generation.
1.4.3. Case of one single resource: the bucket method1.4.4. Case of many resources: reduction of the resource space; 1.4.4.1. Reduction principle; 1.4.4.2. Approach based on the Lagrangian relaxation; 1.4.4.3. Approach based on the surrogate relaxation; 1.5. Conclusion; 1.6. Bibliography; Chapter 2: The Task Allocation Problem; 2.1. Presentation; 2.2. Definitions and modeling; 2.2.1. Definitions; 2.2.2. The processors; 2.2.3. Communications; 2.2.4. Tasks; 2.2.5. Allocation types; 2.2.5.1. Static allocation; 2.2.5.2. Dynamic allocation; 2.2.5.3. With or without pre-emption.
2.2.5.4. Task duplication2.2.6. Allocation/sched…
Subjects
Writers
More from this Series
No reviews yet. Be the first to rate this work.
Related Works
more →
Integer programming and combinatorial optimization
Conference on Integer Programming and Combinatorial Optimization, Houston, Tex.))
Optimization algorithms in physics
Files & Downloads
-
Applications of Combinatorial Optimization -- (.p…
PDF · 6.0 MB · updated -
Applications of Combinatorial Optimization -- (.p…
PDF · 5.3 MB · updated
Rate & Review