Universal Combinatorial Optimization: Matroid Bases and Shortest Paths

Beschreibung

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.

Autor*in

Lara Ruth Turner

Stimmen zu »Universal Combinatorial Optimization: Matroid Bases and Shortest Paths«

Details

Link teilen