Handbook of Combinatorial Optimization: Supplement Volume B, 2. sējumsDing-Zhu Du, Panos M. Pardalos Springer Science & Business Media, 2006. gada 18. aug. - 394 lappuses Combinatorial (or discrete) optimization is one of the most active fields in the interface of operations research, computer science, and applied ma- ematics. Combinatorial optimization problems arise in various applications, including communications network design, VLSI design, machine vision, a- line crew scheduling, corporate planning, computer-aided design and m- ufacturing, database query design, cellular telephone frequency assignment, constraint directed reasoning, and computational biology. Furthermore, combinatorial optimization problems occur in many diverse areas such as linear and integer programming, graph theory, artificial intelligence, and number theory. All these problems, when formulated mathematically as the minimization or maximization of a certain function defined on some domain, have a commonality of discreteness. Historically, combinatorial optimization starts with linear programming. Linear programming has an entire range of important applications including production planning and distribution, personnel assignment, finance, allo- tion of economic resources, circuit simulation, and control systems. Leonid Kantorovich and Tjalling Koopmans received the Nobel Prize (1975) for their work on the optimal allocation of resources. Two important discov- ies, the ellipsoid method (1979) and interior point approaches (1984) both provide polynomial time algorithms for linear programming. These al- rithms have had a profound effect in combinatorial optimization. Many polynomial-time solvable combinatorial optimization problems are special cases of linear programming (e.g. matching and maximum flow). In ad- tion, linear programming relaxations are often the basis for many appro- mation algorithms for solving NP-hard problems (e.g. dual heuristics). |
No grāmatas satura
1.5. rezultāts no 32.
7. lappuse
... matrix we have S is the set of all Hamiltonian cycles in G, and for each Implicit enumeration algorithms for combinatorial problems include two main strategies, namely branching and fathoming. Branching involves partitioning the set of ...
... matrix we have S is the set of all Hamiltonian cycles in G, and for each Implicit enumeration algorithms for combinatorial problems include two main strategies, namely branching and fathoming. Branching involves partitioning the set of ...
11. lappuse
... matrix and our objective is output a least cost Hamiltonian cycle in this graph. This is one of the most studied ... matrices associated with and Further let and be optimal solutions to and and let. 4 The Asymmetric Traveling Salesperson ...
... matrix and our objective is output a least cost Hamiltonian cycle in this graph. This is one of the most studied ... matrices associated with and Further let and be optimal solutions to and and let. 4 The Asymmetric Traveling Salesperson ...
12. lappuse
... matrix (The assignment problem with the distance matrix D corresponds to 1 2 3 4 5 6 1 - 9 0 8 5 2 2 0 - 18 14 11 11 3 6 0 - 2 8 4 4 7 1 10 - 0 0 5 16 4 7 0 - 0 6 12 0 3 8 0 - This leads to a solution with two cycles (1231) and (4564) ...
... matrix (The assignment problem with the distance matrix D corresponds to 1 2 3 4 5 6 1 - 9 0 8 5 2 2 0 - 18 14 11 11 3 6 0 - 2 8 4 4 7 1 10 - 0 0 5 16 4 7 0 - 0 6 12 0 3 8 0 - This leads to a solution with two cycles (1231) and (4564) ...
13. lappuse
... matrix of the correction of the instance with distance matrix D. The proximity measure A proximity measure is an upper bound to the difference between the costs of two solutions for a problem instance, so the stronger the bound, the ...
... matrix of the correction of the instance with distance matrix D. The proximity measure A proximity measure is an upper bound to the difference between the costs of two solutions for a problem instance, so the stronger the bound, the ...
14. lappuse
... matrix shown below. (This example was taken from Balas and Toth [1], p. 381). D 1 2 3 4 1 - 6 5 2 12 9 3 1 - 10 4 8 ... matrix to a new matrix that would output the patched solution if the assignment problem is solved on it. We next ...
... matrix shown below. (This example was taken from Balas and Toth [1], p. 381). D 1 2 3 4 1 - 6 5 2 12 9 3 1 - 10 4 8 ... matrix to a new matrix that would output the patched solution if the assignment problem is solved on it. We next ...
Saturs
2 | |
5 | |
The Steiner Ratio of BanachMinkowski Space A Survey | 55 |
Probabilistic Verification and NonApproximablity 83 | 82 |
Steiner Trees in Industry Xiuzhen Cheng Yingshu Li DingZhu Du and Hung Q Ngo | 193 |
Networkbased Model and Algorithms in Data Mining | 217 |
The Generalized Assignment Problem and Extensions Dolores Romero Morales and H Edwin Romeijn | 259 |
Additional Approaches to the | 297 |
Concluding Remarks | 304 |
Optimal Rectangular Partitions Xiuzhen Cheng DingZhu Du JoonMo Kim and Lu Ruan 313 | 329 |
Introduction | 330 |
Author Index 371 | 370 |
Subject Index | 381 |
Citi izdevumi - Skatīt visu
Handbook of combinatorial optimization, 2. sējums Dingzhu Du,Panos M. Pardalos Ierobežota priekšskatīšana - 1998 |
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
agent applied approximation algorithms approximation scheme Arora assignment problem Banach-Minkowski capacity constraints CDS construction checkable cluster clusterhead combinatorial optimization complexity Computer Science conjecture connected dominating set consider convex corresponding cost data correcting algorithm dataset decoding defined denote distribution edges elements encoding Feige graph product greedy heuristic guillotine Hadamard code Håstad holographic codes independent sets input Journal Lemma length linear lower bound market graph matrix maximum clique minimal minimum spanning tree multi-degree neighbors Neural Networks nodes non-approximability NP complete NP-hard obtain Operations Research optimal solution optimization problems parameters performance ratio polynomial polynomial-time approximation polynomial-time approximation scheme probabilistic problem instances procedure proof prove random rectangular partition rectilinear reduce Romero Morales Section segment solve space SPLP Steiner minimum tree Steiner points Steiner ratio Steiner tree problem subproblems subset tasks techniques Theorem Theory upper bound variables vector verifier vertex vertices WCDS