Free shipping on all orders over $79* Limited Time Only
Track My Order
Help Centre
Likes
My Wish ListsLogin / Join
Booktopia
Australia's local bookstore
Get Free Shipping on orders over $79
Combinatorial Optimization : Theory and Algorithms - Bernhard Korte

Combinatorial Optimization

Theory and Algorithms

By: Bernhard Korte, Jens Vygen

eText | 29 June 2013

At a Glance

eText

$129.00

or 4 interest-free payments of $32.25 with

 or 

Instant online reading in your Booktopia eTextbook Library *

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.
Combinatorial optimization is one of the youngest and most active areas of discrete mathematics, and is probably its driving force today. It became a subject in its own right about 50 years ago. This book describes the most important ideas, theoretical results, and algo­ rithms in combinatorial optimization. We have conceived it as an advanced gradu­ ate text which can also be used as an up-to-date reference work for current research. The book includes the essential fundamentals of graph theory, linear and integer programming, and complexity theory. It covers classical topics in combinatorial optimization as well as very recent ones. The emphasis is on theoretical results and algorithms with provably good performance. Applications and heuristics are mentioned only occasionally. Combinatorial optimization has its roots in combinatorics, operations research, and theoretical computer science. A main motivation is that thousands of real-life problems can be formulated as abstract combinatorial optimization problems. We focus on the detailed study of classical problems which occur in many different contexts, together with the underlying theory. Most combinatorial optimization problems can be formulated naturally in terms of graphs and as (integer) linear programs. Therefore this book starts, after an introduction, by reviewing basic graph theory and proving those results in linear and integer programming which are most relevant for combinatorial optimization.
on
Desktop
Tablet
Mobile

You Can Find This eBook In

Non-FictionMathematicsCombinatorics & Graph TheoryCalculus & Mathematical AnalysisComputing & I.T.DatabasesData Capture & AnalysisComputer ScienceApplied MathematicsOptimisation

Other Editions and Formats

Hardcover

Published: 23rd March 2018

View Product
Paperback

Published: 11th January 2019

View Product

More in Computer Science

Amazon.com : Get Big Fast - Robert Spector

eBOOK

Amazon.com

Get Big Fast

eBook

$22.99

ReFormat : Windows 11 - Adam Natad

eBOOK

ReFormat

Windows 11

eBook

$8.46

This product is categorised by