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 44.
. lappuse
... NP-hard problems (e.g. dual heuristics). Two other developments with a great effect on combinatorial optimiza- tion are the design of efficient integer programming software and the avail- ability of parallel computers. In the last ...
... NP-hard problems (e.g. dual heuristics). Two other developments with a great effect on combinatorial optimiza- tion are the design of efficient integer programming software and the avail- ability of parallel computers. In the last ...
3. lappuse
... NP- hard combinatorial optimization problems, they form a general problem solving tool and can be used for functions defined on a continuous domain as well. We will in fact, motivate the algorithm in the next section using a function ...
... NP- hard combinatorial optimization problems, they form a general problem solving tool and can be used for functions defined on a continuous domain as well. We will in fact, motivate the algorithm in the next section using a function ...
7. lappuse
... NP-hard combinatorial opti- mization problems. In this section we describe how this incorporation is achieved for a general combinatorial optimization problem. We define a combinatorial optimization problem P as a collection of ...
... NP-hard combinatorial opti- mization problems. In this section we describe how this incorporation is achieved for a general combinatorial optimization problem. We define a combinatorial optimization problem P as a collection of ...
9. lappuse
... NP-hard problem instance I is the following. We first execute a data correcting step. We construct a polynomially solvable relaxation of the original instance, and obtain an optimal solution to Note that need not be feasible to I. We ...
... NP-hard problem instance I is the following. We first execute a data correcting step. We construct a polynomially solvable relaxation of the original instance, and obtain an optimal solution to Note that need not be feasible to I. We ...
19. lappuse
... NP-hard (see Lovasz [28]), there has been a sustained research effort aimed at developing practical procedures for solving medium and large-scale problems in this class. In the remainder of this section we suggest two data correcting ...
... NP-hard (see Lovasz [28]), there has been a sustained research effort aimed at developing practical procedures for solving medium and large-scale problems in this class. In the remainder of this section we suggest two data correcting ...
Saturs
19 | |
Preface | 51 |
Probabilistic Verification and NonApproximablity | 82 |
Steiner Trees in Industry | 193 |
Networkbased Model and Algorithms in Data Mining | 217 |
The Generalized Assignment Problem and Extensions | 259 |
Solution Methods | 271 |
3 | 282 |
Additional Approaches to the | 297 |
Concluding Remarks | 304 |
Optimal Rectangular Partitions | 312 |
Connected Dominating Sets in Sensor Networks | 329 |
Author Index | 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 complexity Computer Science conjecture connected dominating set consider convex corresponding cost data correcting dataset decoding defined degree polynomial denote distribution edges elements encoding feasible Feige finite 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 obtained Operations Research optimal solution optimization problems parameters PCP theorem 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 variables vector verifier vertex vertices WCDS