Bicriteria Sum-Problems with Polynomially Bounded Non-Dominated Sets
Minimum Spanning Tree Problem, Shortest Path Problem, Minimum Cost Flow Problem and others
(Sprache: Englisch)
Throughout this book several bicriteria sum optimization problems such as minimum spanning tree problems, shortest path problems, minimum cost flow problems, knapsack problems and global minimum cut problems are considered. For each of those problems the...
Leider schon ausverkauft
versandkostenfrei
Buch
39.95 €
19 DeutschlandCard Punkte
sammeln
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenlose Rücksendung
Produktdetails
Produktinformationen zu „Bicriteria Sum-Problems with Polynomially Bounded Non-Dominated Sets “
Klappentext zu „Bicriteria Sum-Problems with Polynomially Bounded Non-Dominated Sets “
Throughout this book several bicriteria sum optimization problems such as minimum spanning tree problems, shortest path problems, minimum cost flow problems, knapsack problems and global minimum cut problems are considered. For each of those problems the size of the non-dominated sets and the polynomial solvability is investigated. Examples for problems having polynomially bounded non-dominated sets, which are NP-hard to compute, are also presented. Additionally, some general conditions guaranteeing that the Pareto set of such sum optimization problems can be computed in polyomial time are presented.
Bibliographische Angaben
- Autor: Kathrin Weisbrodt
- 2012, Aufl., 124 Seiten, Maße: 22 cm, Kartoniert (TB), Englisch
- Verlag: AV Akademikerverlag
- ISBN-10: 3639388224
- ISBN-13: 9783639388220
Sprache:
Englisch
Kommentar zu "Bicriteria Sum-Problems with Polynomially Bounded Non-Dominated Sets"
0 Gebrauchte Artikel zu „Bicriteria Sum-Problems with Polynomially Bounded Non-Dominated Sets“
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "Bicriteria Sum-Problems with Polynomially Bounded Non-Dominated Sets".
Kommentar verfassen