Save today: Get 40% off Social Science print books or $30 off eBooks in Engineering & Energy!

Handbook of Combinatorial Optimization

Handbook of Combinatorial Optimization

Authors: Ding-Zhu Du, Pardalos, Panos M.

Free Preview

Buy this book

eBook $299.00
price for USA in USD (gross)
  • ISBN 978-1-4613-0303-9
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $459.00
price for USA in USD
  • ISBN 978-0-7923-5019-4
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $379.99
price for USA in USD
  • ISBN 978-1-4613-7987-4
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this book

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).

Table of contents (33 chapters)

Table of contents (33 chapters)

Buy this book

eBook $299.00
price for USA in USD (gross)
  • ISBN 978-1-4613-0303-9
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $459.00
price for USA in USD
  • ISBN 978-0-7923-5019-4
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $379.99
price for USA in USD
  • ISBN 978-1-4613-7987-4
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Handbook of Combinatorial Optimization
Authors
Copyright
1998
Publisher
Springer US
Copyright Holder
Springer Science+Business Media New York
eBook ISBN
978-1-4613-0303-9
DOI
10.1007/978-1-4613-0303-9
Hardcover ISBN
978-0-7923-5019-4
Softcover ISBN
978-1-4613-7987-4
Edition Number
1
Number of Pages
XXIV, 2406
Number of Illustrations
36 b/w illustrations
Topics