Handbook of combinatorial optimization, 2. sējumsDingzhu Du, Panos M. Pardalos Springer Science & Business Media, 1998. gada 15. dec. - 2403 lappuses This is the second of a multi-volume set. The various volumes deal with several algorithmic approaches for discrete problems as well as with many combinatorial problems. The emphasis is on late-1990s developments. Each chapter is essentially expository in nature, but scholarly in its treatment. |
No grāmatas satura
1.–5. rezultāts no 82.
10. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
15. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
17. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
25. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
43. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
Saturs
The Rotation Distance | 65 |
Open Questions | 72 |
Combinatorial Optimization and Coalition Games | 77 |
An Introduction | 105 |
Computational Results | 131 |
Future Work | 149 |
Resource Allocation Problems | 159 |
Proximity Theorems | 197 |
Steiner Minimal Trees in | 397 |
1 | 421 |
Heuristics | 427 |
Applications | 441 |
Dynamical System Approaches | 471 |
3 | 472 |
Online Dominating Set Problems for Graphs | 525 |
Optimization Problems in Optical Networks | 543 |
Lower Bounds on Time Complexity and Improved Algorithms | 209 |
Applications | 225 |
Further Topics | 239 |
Combinatoral Optimization in Clustering | 261 |
A Bibliographic Survey | 331 |
Concluding Remarks | 353 |
149 | 366 |
Shortest Networks on Surfaces | 589 |
Minimum Weight Triangulations | 617 |
Optimization Applications in the Airline Industry | 635 |
727 | |
749 | |
Citi izdevumi - Skatīt visu
Handbook of Combinatorial Optimization: Supplement Volume B, 2. sējums Ding-Zhu Du,Panos M. Pardalos Ierobežota priekšskatīšana - 2006 |
Handbook of Combinatorial Optimization: Supplement Volume B Ding-Zhu Du,Panos M. Pardalos Priekšskatījums nav pieejams - 2011 |
Bieži izmantoti vārdi un frāzes
aircraft airline applications approximation assignment problem binary Chromatic Number cluster Cockayne coloring problem combinatorial optimization complexity Computational Geometry considered constraints construction convex cooperative game core corresponding cost data set data structure defined denote Discrete Discrete Mathematics edge feasible Figure flight geometric shortest path given Graph Coloring grid heuristic incremental algorithm integer Journal Lemma length lower bound Mathematics matrix maximizing method Minimax nni distance nodes NP-hard O(n² objective function Operations Research optimal solution optimization problems pair partition planar graphs plane polygonal obstacles polynomial Proc proof ratio rectilinear resource allocation problem SC/Simple/D scheduling Section sequence short path shortest path queries Simulated Annealing solution concepts solved spanning tree Steiner Minimal Tree Steiner points Steiner ratio Steiner tree subset subtree subtree-transfer T₁ T1 and T2 Theorem Theory topology transformation variables vector vertices visibility graph von Neumann-Morgenstern solution w(er
Populāri fragmenti
1. lappuse - Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN 46556, USA, E-mail: {chen,odaescu}<Dcse.