Stock Image

Handbook of Combinatorial Optimization (Paperback)

Du Ding-zhu

0 ratings by Goodreads
ISBN 10: 1461379873 / ISBN 13: 9781461379874
New Condition: New Soft cover
From Grand Eagle Retail (Wilmington, DE, U.S.A.)

AbeBooks Seller Since October 12, 2005

Quantity Available: 1

Buy New
List Price: US$ 459.00
Price: US$ 555.07 Convert Currency
Shipping: Free Within U.S.A. Destination, Rates & Speeds
Add to basket

30 Day Return Policy

About this Item

Paperback. 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 p.Shipping may be from multiple locations in the US or from the UK, depending on stock availability. 2406 pages. 3.668. Bookseller Inventory # 9781461379874

Ask Seller a Question

Bibliographic Details

Title: Handbook of Combinatorial Optimization (...

Binding: Paperback

Book Condition:New

About this title


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

From the Back Cover:

This is a supplementary volume to the major three-volume Handbook of Combinatorial Optimization set, as well as the Supplement Volume A. It can also be regarded as a stand-alone volume which presents chapters dealing with various aspects of the subject, including optimization problems and algorithmic approaches for discrete problems. Audience This handbook is suitable for all those who use combinatorial optimization methods to model and solve problems.

"About this title" may belong to another edition of this title.

Store Description

Visit Seller's Storefront

Terms of Sale:

We guarantee the condition of every book as it¿s described on the Abebooks web sites. If you¿ve changed
your mind about a book that you¿ve ordered, please use the Ask bookseller a question link to contact us
and we¿ll respond within 2 business days.
Books ship from California and Michigan.

Shipping Terms:

Orders usually ship within 2 business days. All books within the US ship free of charge. Delivery is 4-14 business days anywhere in the United States.

Books ship from California and Michigan.

If your book order is heavy or oversized, we may contact you to let you know extra shipping is required.

List this Seller's Books

Payment Methods
accepted by seller

Visa Mastercard American Express