Please note: In order to keep Hive up to date and provide users with the best features, we are no longer able to fully support Internet Explorer. The site is still available to you, however some sections of the site may appear broken. We would encourage you to move to a more modern browser like Firefox, Edge or Chrome in order to experience the site fully.

Supporting your high street Find out how »
Handbook of Combinatorial Optimization, PDF eBook

Handbook of Combinatorial Optimization PDF

PDF

Download - Immediately Available
Please note: eBooks can only be purchased with a UK issued credit card and all our eBooks (ePub and PDF) are DRM protected.

Description

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

Information

Other Formats

Save 14%

£249.50

£212.08

Download - Immediately Available
Add to Basket
Sign in to add to wishlist
 
Delivered to your inbox

to transfer to your device

eBook Help

Is this the right eBook for
my device? How do I download
this eBook? See help and FAQs pages

Information