Concepts of combinatorial optimization / (Record no. 13644)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 05893cam a2200685Mi 4500 |
| 001 - CONTROL NUMBER | |
| control field | ocn887507297 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | OCoLC |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20171224114715.0 |
| 006 - FIXED-LENGTH DATA ELEMENTS--ADDITIONAL MATERIAL CHARACTERISTICS--GENERAL INFORMATION | |
| fixed length control field | m o d |
| 007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION | |
| fixed length control field | cr cnu---unuuu |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 140816s2014 xx o 000 0 eng d |
| 040 ## - CATALOGING SOURCE | |
| Original cataloging agency | EBLCP |
| Language of cataloging | eng |
| Description conventions | pn |
| Transcribing agency | EBLCP |
| Modifying agency | MHW |
| -- | DG1 |
| -- | N$T |
| -- | OCLCQ |
| -- | VRC |
| -- | CHVBK |
| -- | OCLCF |
| -- | DEBSZ |
| -- | DEBBG |
| -- | OCLCQ |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9781119005216 |
| Qualifying information | (electronic bk.) |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 1119005213 |
| Qualifying information | (electronic bk.) |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9781119015185 |
| Qualifying information | (electronic bk.) |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 1119015189 |
| Qualifying information | (electronic bk.) |
| 029 1# - (OCLC) | |
| OCLC library identifier | CHBIS |
| System control number | 010259771 |
| 029 1# - (OCLC) | |
| OCLC library identifier | CHDSB |
| System control number | 006318344 |
| 029 1# - (OCLC) | |
| OCLC library identifier | CHVBK |
| System control number | 325941009 |
| 029 1# - (OCLC) | |
| OCLC library identifier | CHVBK |
| System control number | 326773215 |
| 029 1# - (OCLC) | |
| OCLC library identifier | DEBBG |
| System control number | BV043397063 |
| 029 1# - (OCLC) | |
| OCLC library identifier | DEBSZ |
| System control number | 431746133 |
| 035 ## - SYSTEM CONTROL NUMBER | |
| System control number | (OCoLC)887507297 |
| 050 #4 - LIBRARY OF CONGRESS CALL NUMBER | |
| Classification number | QA402.5 |
| Item number | .C545123 2014 |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | MAT |
| Subject category code subdivision | 003000 |
| Source | bisacsh |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | MAT |
| Subject category code subdivision | 029000 |
| Source | bisacsh |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 519.64 |
| Edition number | 23 |
| 049 ## - LOCAL HOLDINGS (OCLC) | |
| Holding library | MAIN |
| 245 00 - TITLE STATEMENT | |
| Title | Concepts of combinatorial optimization / |
| Statement of responsibility, etc | edited by Vangelis Th. Paschos. |
| 250 ## - EDITION STATEMENT | |
| Edition statement | 2nd ed. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Place of publication, distribution, etc | Hoboken : |
| Name of publisher, distributor, etc | Wiley, |
| Date of publication, distribution, etc | 2014. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | 1 online resource (409 pages). |
| 336 ## - | |
| -- | text |
| -- | txt |
| -- | rdacontent |
| 337 ## - | |
| -- | computer |
| -- | c |
| -- | rdamedia |
| 338 ## - | |
| -- | online resource |
| -- | cr |
| -- | rdacarrier |
| 490 1# - SERIES STATEMENT | |
| Series statement | ISTE |
| 588 0# - | |
| -- | Print version record. |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | Cover; Title Page; Copyright; Contents; Preface; PART I: Complexity of CombinatorialOptimization Problems; Chapter 1: Basic Concepts in Algorithmsand Complexity Theory; 1.1. Algorithmic complexity; 1.2. Problem complexity; 1.3. The classes P, NP and NPO; 1.4. Karp and Turing reductions; 1.5. NP-completeness; 1.6. Two examples of NP-complete problems; 1.6.1. MIN VERTEX COVER; 1.6.2. MAX STABLE; 1.7. A few words on strong and weak NP-completeness; 1.8. A few other well-known complexity classes; 1.9. Bibliography; Chapter 2: Randomized Complexity; 2.1. Deterministic and probabilistic algorithms. |
| 505 8# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | 2.1.1. Complexity of a Las Vegas algorithm2.1.2. Probabilistic complexity of a problem; 2.2. Lower bound technique; 2.2.1. Definitions and notations; 2.2.2. Minimax theorem; 2.2.3. The Loomis lemma and the Yao principle; 2.3. Elementary intersection problem; 2.3.1. Upper bound; 2.3.2. Lower bound; 2.3.3. Probabilistic complexity; 2.4. Conclusion; 2.5. Bibliography; PART II: Classical Solution Methods; Chapter 3: Branch-and-Bound Methods; 3.1. Introduction; 3.2. Branch-and-bound method principles; 3.2.1. Principle of separation; 3.2.2. Pruning principles; 3.2.2.1. Bound. |
| 505 8# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | 3.2.2.2. Evaluation function3.2.2.3. Use of the bound and of the evaluation function for pruning; 3.2.2.4. Other pruning principles; 3.2.2.5. Pruning order; 3.2.3. Developing the tree; 3.2.3.1. Description of development strategies; 3.2.3.2. Compared properties of the depth first and best first strategies; 3.3. A detailed example: the binary knapsack problem; 3.3.1. Calculating the initial bound; 3.3.2. First principle of separation; 3.3.3. Pruning without evaluation; 3.3.4. Evaluation; 3.3.5. Complete execution of the branch-and-bound method for finding only oneoptimal solution. |
| 505 8# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | 3.3.6. First variant: finding all the optimal solutions3.3.7. Second variant: best first search strategy; 3.3.8. Third variant: second principle of separation; 3.4. Conclusion; 3.5. Bibliography; Chapter 4: Dynamic Programming; 4.1. Introduction; 4.2. A first example: crossing the bridge; 4.3. Formalization; 4.3.1. State space, decision set, transition function; 4.3.2. Feasible policies, comparison relationships and objectives; 4.4. Some other examples; 4.4.1. Stock management; 4.4.2. Shortest path bottleneck in a graph; 4.4.3. Knapsack problem; 4.5. Solution; 4.5.1. Forward procedure. |
| 505 8# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | 4.5.2. Backward procedure4.5.3. Principles of optimality and monotonicity; 4.6. Solution of the examples; 4.6.1. Stock management; 4.6.2. Shortest path bottleneck; 4.6.3. Knapsack; 4.7. A few extensions; 4.7.1. Partial order and multicriteria optimization; 4.7.1.1. New formulation of the problem; 4.7.1.2. Solution; 4.7.1.3. Examples; 4.7.2. Dynamic programming with variables; 4.7.2.1. Sequential decision problems under uncertainty; 4.7.2.2. Solution; 4.7.2.3. Example; 4.7.3. Generalized dynamic programming; 4.8. Conclusion; 4.9. Bibliography; PART III: Elements from MathematicalProgramming. |
| 500 ## - GENERAL NOTE | |
| General note | Chapter 5: Mixed Integer Linear Programming Models forCombinatorial Optimization Problems. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | 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 abo. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Combinatorial optimization. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Programming (Mathematics) |
| 650 #7 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | MATHEMATICS |
| General subdivision | Applied. |
| Source of heading or term | bisacsh |
| 650 #7 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | MATHEMATICS |
| General subdivision | Probability & Statistics |
| -- | General. |
| Source of heading or term | bisacsh |
| 650 #7 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Combinatorial optimization. |
| Source of heading or term | fast |
| -- | (OCoLC)fst00868980 |
| 650 #7 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Programming (Mathematics) |
| Source of heading or term | fast |
| -- | (OCoLC)fst01078701 |
| 650 #7 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Kombinatorische Optimierung. |
| -- | (DE-588)4031826-6 |
| Source of heading or term | gnd |
| 655 #4 - INDEX TERM--GENRE/FORM | |
| Genre/form data or focus term | Electronic books. |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Paschos, Vangelis Th. |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
| Display text | Print version: |
| Main entry heading | Paschos, Vangelis Th. |
| Title | Concepts of Combinatorial Optimization. |
| Place, publisher, and date of publication | Hoboken : Wiley, ©2014 |
| International Standard Book Number | 9781848216563 |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
| Uniform title | ISTE. |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | http://onlinelibrary.wiley.com/book/10.1002/9781119005216 |
| Public note | Wiley Online Library |
| 938 ## - | |
| -- | EBL - Ebook Library |
| -- | EBLB |
| -- | EBL1765108 |
| 938 ## - | |
| -- | EBSCOhost |
| -- | EBSC |
| -- | 829093 |
| 994 ## - | |
| -- | 92 |
| -- | DG1 |
No items available.