Handbook of Combinatorial Optimization : Volume1–3 / edited by Ding-Zhu Du, Panos M. Pardalos
| データ種別 | 電子ブック |
|---|---|
| 出版情報 | Boston, MA : Springer US , 1999 |
| 本文言語 | 英語 |
| 大きさ | XXIV, 2406 p. 36 illus : online resource |
書誌詳細を非表示
| 内容注記 | Mixed-Integer Nonlinear Optimization in Process Synthesis Approximate Algorithms and Heuristics for MAX-SAT Connections between Nonlinear Programming and Discrete Optimization Interior Point Methods for Combinatorial Optimization Knapsack Problems Fractional Combinatorial Optimization Reformulation-Linearization Techniques for Discrete Optimization Problems Gröbner Bases in Integer Programming Applications of Set Covering, Set Packing and Set Partitioning Models: A Survey Efficient Algorithms for Geometric Shortest Path Query Problems Computing Distances between Evolutionary Trees Combinatorial Optimization and Coalition Games Steiner Minimal Trees: An Introduction, Parallel Computation, and Future Work Resource Allocation Problems Combinatoral Optimization in Clustering The Graph Coloring Problem: A Bibliographic Survey Steiner Minimal Trees in E3: Theory, Algorithms, and Applications Dynamical System Approaches to Combinatorial Optimization On-line Dominating Set Problems for Graphs Optimization Problems in Optical Networks Shortest Networks on Surfaces Minimum Weight Triangulations Optimization Applications in the Airline Industry Semidefinite Relaxations, Multivariate Normal Distributions, and Order Statistics A Review of Machine Scheduling: Complexity, Algorithms and Approximability Routing and Topology Embedding in Lightwave Networks The Quadratic Assignment Problem Algorithmic Aspects of Domination in Graphs Selected Algorithmic Techniques for Parallel Optimization Multispace Search for Combinatorial Optimization The Equitable Coloring of Graphs Randomized Parallel Algorithms for Combinatorial Optimization Tabu Search Author Index Author Index Author Index Author Index of Volumes 1–3 Subject Index of Volumes 1–3 |
|---|---|
| 一般注記 | Combinatorial (or discrete) optimization is one of the most active fields in the interface of operations research, computer science, and applied math ematics. Combinatorial optimization problems arise in various applications, including communications network design, VLSI design, machine vision, air line crew scheduling, corporate planning, computer-aided design and man 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, alloca 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 discover ies, the ellipsoid method (1979) and interior point approaches (1984) both provide polynomial time algorithms for linear programming. These algo 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 addi tion, linear programming relaxations are often the basis for many approxi mation algorithms for solving NP-hard problems (e.g. dual heuristics) |
| 著者標目 | Du, Ding-Zhu editor Pardalos, Panos M. editor SpringerLink (Online service) |
| 件 名 | LCSH:Mathematics LCSH:Computers LCSH:Computer science -- Mathematics 全ての件名で検索 LCSH:Information theory LCSH:Combinatorics FREE:Mathematics FREE:Combinatorics FREE:Discrete Mathematics in Computer Science FREE:Theory of Computation FREE:Information and Communication, Circuits |
| 分 類 | DC23:511.6 |
| 巻冊次 | ISBN:9781461303039 
|
| ISBN | 9781461303039 |
| URL | http://dx.doi.org/10.1007/978-1-4613-0303-9 |
目次／あらすじ
類似資料
この資料を見た人はこんな資料も見ています
この資料の利用統計
このページへのアクセス回数：1回
※2021年9月12日以降