Handbook of Combinatorial Optimization Supplement Volume A

Language: English

Published by Springer, 2010

1441948139 / 9781441948137

  • Softcover
  • New
See all details

Seller: Home-set, Mannheim, GermanyHome-set

5-star seller

AbeBooks seller since April 13, 2026

Softcover

Condition: New

US$ 227.80

US$ 65.75 shipping 
Ships from Germany to U.S.A.

Quantity: 2 available

Add to basket
Free 30-day returns

Item description from seller

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. dualheuristics). Sprache: Englisch Gewicht in Gramm: 984.…

Title
Handbook of Combinatorial Optimization Supplement Volume A
Publisher
Springer
Publication year
2010
Condition
Neu
Binding
Softcover/Taschenbuch
Language
English
ISBN 10
1441948139
ISBN 13
9781441948137
Item weight
984 grams

Home-set

Mannheim, Germany

5-star seller

AbeBooks seller since April 13, 2026

Shipping rates from Germany to U.S.A.

Item10 to 12 business days8 to 10 business days
First itemUS$ 65.75US$ 98.96
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.

Payment methods

  • Visa
  • Mastercard
  • American Express
  • Apple Pay
  • Google Pay
  • Check

Specialty

Buch

Seller's business information

Home-set

Germany