|
|
|
|
LEADER |
00000cam a2200000Mu 4500 |
001 |
EBOOKCENTRAL_ocn828299271 |
003 |
OCoLC |
005 |
20240329122006.0 |
006 |
m o d |
007 |
cr |n||||||||| |
008 |
130223s2013 enk o 000 0 eng d |
040 |
|
|
|a EBLCP
|b eng
|e pn
|c EBLCP
|d OCLCQ
|d DG1
|d YDXCP
|d OCLCF
|d OCLCQ
|d DEBSZ
|d OCLCQ
|d DEBBG
|d DG1
|d LIP
|d MERUC
|d ZCU
|d OCLCQ
|d ICG
|d OCLCQ
|d U3W
|d OCLCQ
|d DKC
|d OCLCQ
|d OCLCO
|d OCLCQ
|d OCLCO
|d OCLCL
|
019 |
|
|
|a 904273345
|a 992822333
|
020 |
|
|
|a 9781118600283
|q (electronic bk.)
|
020 |
|
|
|a 1118600282
|q (electronic bk.)
|
020 |
|
|
|z 9781118600115
|
020 |
|
|
|z 1118600118
|
029 |
1 |
|
|a AU@
|b 000050718571
|
029 |
1 |
|
|a CHNEW
|b 000941281
|
029 |
1 |
|
|a CHVBK
|b 480215561
|
029 |
1 |
|
|a DEBBG
|b BV043395481
|
029 |
1 |
|
|a DEBBG
|b BV044050050
|
029 |
1 |
|
|a DEBSZ
|b 431339007
|
029 |
1 |
|
|a DEBSZ
|b 457634650
|
029 |
1 |
|
|a DEBSZ
|b 485032708
|
029 |
1 |
|
|a NZ1
|b 15915096
|
035 |
|
|
|a (OCoLC)828299271
|z (OCoLC)904273345
|z (OCoLC)992822333
|
050 |
|
4 |
|a QA402.5
|
082 |
0 |
4 |
|a 519.6/4
|a 519.64
|
049 |
|
|
|a UAMI
|
100 |
1 |
|
|a Paschos, Vangelis Th.
|
245 |
1 |
0 |
|a Applications of Combinatorial Optimization.
|
260 |
|
|
|a London :
|b Wiley,
|c 2013.
|
300 |
|
|
|a 1 online resource (409 pages)
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
490 |
1 |
|
|a ISTE
|
505 |
0 |
|
|a Cover; Applications of Combinatorial Optimization; Title Page; Copyright Page; Table of 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.
|
505 |
8 |
|
|a 1.4.2. General principle of effective label generation1.4.3. Case of one single resource: the bucket method; 1.4.4. Case of many resources: reduction of the resource space; 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.6. Allocation/scheduling; 2.2.7. Modeling; 2.3. Review of the main works; 2.3.1. Polynomial cases; 2.3.2. Approximability; 2.3.3. Approximate solution; 2.3.4. Exact solution.
|
505 |
8 |
|
|a 2.3.5. Independent tasks case2.4. A little-studied model; 2.4.1. Model; 2.4.2. A heuristic based on graphs; 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 tested; 3.2.1. Exact separation with respect to a mixed relaxation; 3.2.2. Approximate separation using a heuristic; 3.2.3. Restriction + separation + relaxed lifting (RSRL); 3.2.4. Disjunctive programming and the lift and project procedure; 3.2.5. Reformulation-linearization technique (RLT).
|
505 |
8 |
|
|a 3.3. Computational results3.3.1. Presentation of test problems; 3.3.2. Presentation of the results; 3.3.3. Discussion of the 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.3.1. Group technology; 4.3.2. Locating equipment; 4.4. Tactical planning and inventory management; 4.4.1. A linear programming model for medium-term planning; 4.4.2. Inventory management; 4.4.3. Wagner and Whitin model; 4.4.4. The economic order quantity model (EOQ).
|
505 |
8 |
|
|a 4.4.5. The EOQ model with joint replenishments4.5. Operations planning and scheduling; 4.5.1. Tooling; 4.5.2. Robotic cells; 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.3.1. Location with balancing requirements; 5.3.2. Multiproduct production-distribution; 5.3.3. Hub location; 5.4. Long-distance transport; 5.4.1. Service network design; 5.4.2. Static formulations; 5.4.3. Dynamic formulations; 5.4.4. Fleet management; 5.5. Vehicle routing problems.
|
500 |
|
|
|a 5.5.1. Definitions and complexity.
|
520 |
|
|
|a 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. "Applications of Combinatorial Optimization" is presenting a certain number among the most common and well-known applications of Combinatorial Optimization.
|
588 |
0 |
|
|a Print version record.
|
590 |
|
|
|a ProQuest Ebook Central
|b Ebook Central Academic Complete
|
650 |
|
0 |
|a Combinatorial optimization.
|
650 |
|
6 |
|a Optimisation combinatoire.
|
650 |
|
7 |
|a Combinatorial optimization
|2 fast
|
758 |
|
|
|i has work:
|a Applications of combinatorial optimization (Text)
|1 https://id.oclc.org/worldcat/entity/E39PCFPxf7YDQxwmbyvcx9wfjd
|4 https://id.oclc.org/worldcat/ontology/hasWork
|
776 |
0 |
8 |
|i Print version:
|a Paschos, Vangelis Th.
|t Applications of Combinatorial Optimization.
|d London : Wiley, ©2013
|z 9781848211490
|
830 |
|
0 |
|a ISTE.
|
856 |
4 |
0 |
|u https://ebookcentral.uam.elogim.com/lib/uam-ebooks/detail.action?docID=1124651
|z Texto completo
|
938 |
|
|
|a EBL - Ebook Library
|b EBLB
|n EBL1124651
|
938 |
|
|
|a YBP Library Services
|b YANK
|n 9985000
|
938 |
|
|
|a YBP Library Services
|b YANK
|n 10225619
|
994 |
|
|
|a 92
|b IZTAP
|