Springer Book Archives: eBooks only 8.99 each! Save now >>

Handbook of Combinatorial Optimization

Handbook of Combinatorial Optimization

Supplement Volume A

Editors: Du, Ding-Zhu, Pardalos, Panos (Eds.)

Free Preview

Buy this book

eBook $169.00
price for USA in USD (gross)
  • ISBN 978-1-4757-3023-4
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $219.99
price for USA in USD
  • ISBN 978-0-7923-5924-1
  • Free shipping for individuals worldwide
  • Immediate ebook access, if available*, with your print order
  • Usually dispatched within 3 to 5 business days.
Softcover $219.99
price for USA in USD
  • ISBN 978-1-4419-4813-7
  • Free shipping for individuals worldwide
  • Immediate ebook access, if available*, with your print order
  • 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 (9 chapters)

Table of contents (9 chapters)

Buy this book

eBook $169.00
price for USA in USD (gross)
  • ISBN 978-1-4757-3023-4
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $219.99
price for USA in USD
  • ISBN 978-0-7923-5924-1
  • Free shipping for individuals worldwide
  • Immediate ebook access, if available*, with your print order
  • Usually dispatched within 3 to 5 business days.
Softcover $219.99
price for USA in USD
  • ISBN 978-1-4419-4813-7
  • Free shipping for individuals worldwide
  • Immediate ebook access, if available*, with your print order
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Handbook of Combinatorial Optimization
Book Subtitle
Supplement Volume A
Editors
  • Ding-Zhu Du
  • Panos Pardalos
Copyright
1999
Publisher
Springer US
Copyright Holder
Springer-Verlag US
eBook ISBN
978-1-4757-3023-4
DOI
10.1007/978-1-4757-3023-4
Hardcover ISBN
978-0-7923-5924-1
Softcover ISBN
978-1-4419-4813-7
Edition Number
1
Number of Pages
VIII, 648
Topics

*immediately available upon purchase as print book shipments may be delayed due to the COVID-19 crisis. ebook access is temporary and does not include ownership of the ebook. Only valid for books with an ebook version. Springer Reference Works are not included.