你好! Shipping to Taiwan with premium packaging for just NT$300 

Ship to
Taiwan
0

My Account

  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional

menu

Select your country

Americas

Europe

Rest of the world

portada Handbook of Combinatorial Optimization
Type
Physical Book
Author
Publisher
Language
English
Pages
2406
Format
Paperback
Dimensions
23.4x14.7x12.4 cm
Weight
3.27 kg.
ISBN13
9781461379874
Categories

Handbook of Combinatorial Optimization

Panos M. Pardalos (Author) · Ding-Zhu Du (Author) · Springer · Paperback

Handbook of Combinatorial Optimization - Ding-Zhu Du ; Pardalos, Panos M.

Cheaper New Book Imported to Taiwan
Delivery: 21 Oct - 03 Nov Shipping: 17 to 21 business days.
NT$ 9,776
Faster New Book Imported to Taiwan
Delivery: 20 Oct - 28 Oct Shipping: 16 to 17 business days.
NT$ 10,108
NT$ 9,776

Choose the list to add your product or create one New List

Go to My Wishlists
Calculate shipping cost

Synopsis "Handbook of Combinatorial Optimization"

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

Customers reviews

More customer reviews
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)

Frequently Asked Questions about the Book

Is the book original?

All books in our catalog are Original.

In what language is the book written?

The book is written in English.

What is the format of this book?

The binding of this edition is Paperback.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews