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
6.–10. rezultāts no 64.
26. lappuse
... reduced to to our problem. However, PPAr is not a polynomial in and so PPAr with a large is not practically useful. It is clear that if PPAr will always find an optimal solution We can embed PPAr in a branch and bound framework to ...
... reduced to to our problem. However, PPAr is not a polynomial in and so PPAr with a large is not practically useful. It is clear that if PPAr will always find an optimal solution We can embed PPAr in a branch and bound framework to ...
27. lappuse
... reduced to of Corollary 5.3. Thus, for example, if then PPAr is Notice that for a submodular function PPAr with a fixed may ter- eter, then we branch on a variable to partition the interval [S, T] into two intervals and This branching ...
... reduced to of Corollary 5.3. Thus, for example, if then PPAr is Notice that for a submodular function PPAr with a fixed may ter- eter, then we branch on a variable to partition the interval [S, T] into two intervals and This branching ...
29. lappuse
... reduce exponentially with increasing density. Herein we report the performance of DCA-MSFr on QCP instances of varying size and densities. The maximum time that we allow for an instance is 10 CPU minutes on an personal computer running ...
... reduce exponentially with increasing density. Herein we report the performance of DCA-MSFr on QCP instances of varying size and densities. The maximum time that we allow for an instance is 10 CPU minutes on an personal computer running ...
32. lappuse
... reduction in time is more pronounced for problems with higher size and higher densities. 6. The. Simple. Plant. Location. Problem. of The Simple Plant Location Problem (SPLP) takes a set sites in which plants can be located, a set of ...
... reduction in time is more pronounced for problems with higher size and higher densities. 6. The. Simple. Plant. Location. Problem. of The Simple Plant Location Problem (SPLP) takes a set sites in which plants can be located, a set of ...
37. lappuse
... reduction procedure (RP), whose primary aim is to reduce the coefficients of terms in the Hammer function, and if we can reduce it to zero, to eliminate the term from the Hammer function. This procedure is based on fathoming rules of ...
... reduction procedure (RP), whose primary aim is to reduce the coefficients of terms in the Hammer function, and if we can reduce it to zero, to eliminate the term from the Hammer function. This procedure is based on fathoming rules of ...
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