UID:
almafu_9959328279202883
Format:
1 online resource (722 pages)
ISBN:
9781118600276
,
1118600274
,
9781118600207
,
1118600207
,
9781118600184
,
1118600185
,
1322060878
,
9781322060873
,
9781119015192
,
1119015197
Series Statement:
ISTE
Content:
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 aims 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. "Paradigms of Combinatorial Optimization" is divided in two parts: Paradigmatic Problems, that handles several famous combinatorial optimization probl.
Note:
Cover; Paradigms of Combinatorial Optimization; Title Page; Copyright Page; Table of Contents; Preface; PART I. PARADIGMATIC PROBLEMS; Chapter 1. Optimal Satisfiability; 1.1. Introduction; 1.2. Preliminaries; 1.2.1. Constraint satisfaction problems: decision and optimization versions; 1.2.2. Constraint types; 1.3. Complexity of decision problems; 1.4. Complexity and approximation of optimization problems; 1.4.1. Maximization problems; 1.4.2. Minimization problems; 1.5. Particular instances of constraint satisfaction problems; 1.5.1. Planar instances; 1.5.2. Dense instances.
,
Chapter 3. Location Problems3.1. Introduction; 3.1.1. Weber's problem; 3.1.2. A classification; 3.2. Continuous problems; 3.2.1. Complete covering; 3.2.2. Maximal covering; 3.2.3. Empty covering; 3.2.4. Bicriteria models; 3.2.5. Covering with multiple resources; 3.3. Discrete problems; 3.3.1. p-Center; 3.3.2. p-Dispersion; 3.3.3. p-Median; 3.3.4. Hub; 3.3.5. p-Maxisum; 3.4. On-line problems; 3.5. The quadratic assignment problem; 3.5.1. Definitions and formulations of the problem; 3.5.2. Complexity; 3.5.3. Relaxations and lower bounds; 3.6. Conclusion; 3.7. Bibliography.
,
5.3.3. Bin packing: one-phase level heuristics5.3.4. Bin packing: one-phase non-level heuristics; 5.3.5. Metaheuristics; 5.3.6. Approximation algorithms; 5.4. Lower bounds; 5.4.1. Lower bounds for level packing; 5.5. Exact algorithms; 5.6. Acknowledgements; 5.7. Bibliography; Chapter 6. The Maximum Cut Problem; 6.1. Introduction; 6.2. Complexity and polynomial cases; 6.3. Applications; 6.3.1. Spin glass models; 6.3.2. Unconstrained 0-1 quadratic programming; 6.3.3. The via minimization problem; 6.4. The cut polytope; 6.4.1. Valid inequalities and separation; 6.4.2. Branch-and-cut algorithms.
Additional Edition:
Print version: Paschos, Vangelis Th. Paradigms of Combinatorial Optimization : Problems and New Approaches. London : Wiley, ©2013 ISBN 9781848211483
Language:
English
Keywords:
Electronic books.
;
Electronic books.
;
Electronic books.
URL:
https://onlinelibrary.wiley.com/doi/book/10.1002/9781118600207
URL:
https://onlinelibrary.wiley.com/doi/book/10.1002/9781118600207
URL:
https://onlinelibrary.wiley.com/doi/book/10.1002/9781118600207
Bookmarklink
