Progress in Combinatorial Optimization

· Academic Press
eBook
386
Halaman
Memenuhi syarat
Rating dan ulasan tidak diverifikasi  Pelajari Lebih Lanjut

Tentang eBook ini

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.

Beri rating eBook ini

Sampaikan pendapat Anda.

Informasi bacaan

Smartphone dan tablet
Instal aplikasi Google Play Buku untuk Android dan iPad/iPhone. Aplikasi akan disinkronkan secara otomatis dengan akun Anda dan dapat diakses secara online maupun offline di mana saja.
Laptop dan komputer
Anda dapat mendengarkan buku audio yang dibeli di Google Play menggunakan browser web komputer.
eReader dan perangkat lainnya
Untuk membaca di perangkat e-ink seperti Kobo eReaders, Anda perlu mendownload file dan mentransfernya ke perangkat Anda. Ikuti petunjuk Pusat bantuan yang mendetail untuk mentransfer file ke eReaders yang didukung.