|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910808645303321 |
|
|
Titolo |
Applications of combinatorial optimization / / edited by Vangelis Th. Paschos |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
London, [England] ; ; Hoboken, New Jersey : , : ISTE : , : Wiley, , 2014 |
|
©2014 |
|
|
|
|
|
|
|
|
|
ISBN |
|
1-119-00538-8 |
1-119-01522-7 |
|
|
|
|
|
|
|
|
Edizione |
[Revised and updated second edition.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (449 p.) |
|
|
|
|
|
|
Collana |
|
Mathematics and Statistics Series |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Combinatorial optimization |
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Description based upon print version of record. |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and index at the end of each chapters. |
|
|
|
|
|
|
|
|
Nota di contenuto |
|
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/scheduling; 2.2.7. Modeling; 2.2.7.1. Modeling costs; 2.2.7.2. Constraints; 2.2.7.3. Objectives of the allocation; 2.2.7.3.1. Minimizing the execution duration; 2.2.7.3.2. |
|
|
|
|