0
Your cart

Your cart is empty

Books > Social sciences > Sociology, social studies > Social issues

Not currently available

Articles on Combinatorial Optimization, Including - Basis (Linear Algebra), Matroid, Matroid Embedding, Pregeometry (Model Theory), Signed Graph, Colored Matroid, Biased Graph, Polymatroid, Tutte Polynomial, Dowling Geometry, Gain Graph (Paperback) Loot Price: R404
Discovery Miles 4 040
You Save: R97 (19%)
Articles on Combinatorial Optimization, Including - Basis (Linear Algebra), Matroid, Matroid Embedding, Pregeometry (Model...

Articles on Combinatorial Optimization, Including - Basis (Linear Algebra), Matroid, Matroid Embedding, Pregeometry (Model Theory), Signed Graph, Colored Matroid, Biased Graph, Polymatroid, Tutte Polynomial, Dowling Geometry, Gain Graph (Paperback)

Hephaestus Books

 (sign in to rate)
List price R501 Loot Price R404 Discovery Miles 4 040 You Save R97 (19%)

Bookmark and Share

Supplier out of stock. If you add this item to your wish list we will let you know when it becomes available.

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Hephaestus Books represents a new publishing paradigm, allowing disparate content sources to be curated into cohesive, relevant, and informative books. To date, this content has been curated from Wikipedia articles and images under Creative Commons licensing, although as Hephaestus Books continues to increase in scope and dimension, more licensed and public domain content is being added. We believe books such as this represent a new and exciting lexicon in the sharing of human knowledge. This particular book contains chapters focused on Combinatorial optimization, and Matroid theory. More info: Combinatorial optimization is a topic in theoretical computer science and applied mathematics that consists of finding the least-cost solution to a mathematical problem in which each solution is associated with a numerical cost. In many such problems, exhaustive search is not feasible. It operates on the domain of those optimization problems, in which the set of feasible solutions is discrete or can be reduced to discrete, and in which the goal is to find the best solution. Some common problems involving combinatorial optimization are the traveling salesman problem and the minimum spanning tree problem.

General

Imprint: Hephaestus Books
Country of origin: United States
Release date: September 2011
First published: September 2011
Authors: Hephaestus Books
Dimensions: 246 x 189 x 11mm (L x W x T)
Format: Paperback - Trade
Pages: 210
ISBN-13: 978-1-244-50930-6
Categories: Books > Science & Mathematics > Mathematics > General
Books > Social sciences > Sociology, social studies > Social issues > General
LSN: 1-244-50930-2
Barcode: 9781244509306

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners