Title | Handbook of Combinatorial Optimization [electronic resource] : Supplement Volume A / edited by Ding-Zhu Du, Panos M. Pardalos |
---|---|

Imprint | Boston, MA : Springer US : Imprint: Springer, 1999 |

Connect to | http://dx.doi.org/10.1007/978-1-4757-3023-4 |

Descript | VIII, 648 p. online resource |

SUMMARY

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)

CONTENT

The Maximum Clique Problem -- Linear Assignment Problems and Extensions -- Bin Packing Approximation Algorithms: Combinatorial Analysis -- Feedback Set Problems -- Neural Networks Approaches for Combinatorial Optimization Problems -- Frequency Assignment Problems -- Algorithms for the Satisfiability (SAT) Problem -- The Steiner Ratio of Lp-planes -- A Cogitative Algorithm for Solving the Equal Circles Packing Problem -- Author Index

Mathematics
Computers
Computer science -- Mathematics
Information theory
Probabilities
Discrete mathematics
Combinatorics
Mathematics
Discrete Mathematics
Probability Theory and Stochastic Processes
Combinatorics
Discrete Mathematics in Computer Science
Theory of Computation
Information and Communication Circuits