ISBN 978-3-8439-0885-6

978-3-8439-0885-6, Reihe Mathematik

Lara Ruth Turner
Universal Combinatorial Optimization: Matroid Bases and Shortest Paths

236 Seiten, Dissertation Technische Universität Kaiserslautern (2012), Softcover, A5

Zusammenfassung / Abstract

In this thesis, universal combinatorial optimization is introduced as a unifying concept to model combinatorial optimization problems with classical and new objective functions. The focus is on universal matroid base problems and universal shortest path problems.