Get Free Shipping on orders over $79
Progress in Combinatorial Optimization - Author

Progress in Combinatorial Optimization

By: Author

eText | 10 May 2014 | Edition Number 1

At a Glance

eText


$89.10

or 4 interest-free payments of $22.27 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.
Progress in Combinatorial Optimization provides information pertinent to the fundamental aspects of combinatorial optimization. This book discusses how to determine whether or not a particular structure exists.

Organized into 21 chapters, this book begins with an overview of a polar characterization of facets of polyhedra obtained by lifting facets of lower dimensional polyhedra. This text then discusses how to obtain bounds on the value of the objective in a graph partitioning problem in terms of spectral information about the graph. Other chapters consider the notion of a triangulation of an oriented matroid and show that oriented matroid triangulation yield triangulations of the underlying polytopes. This book discusses as well the selected results and problems on perfect ad imperfect graphs. The final chapter deals with the weighted parity problem for gammoids, which can be reduced to the weighted graphic matching problem.

This book is a valuable resource for mathematicians and research workers.
on
Desktop
Tablet
Mobile

More in Applied Mathematics