Cantitate/Preț
Produs
Total produse
Vezi coșul
Generalized Network Improvement and Packing Problems de Michael Holzhauser

Generalized Network Improvement and Packing Problems

Autor Michael Holzhauser
en Limba Engleză Paperback – 12 ian 2017
Michael Holzhauser discusses generalizations of well-known network flow and packing problems by additional or modified side constraints. By exploiting the inherent connection between the two problem classes, the author investigates the complexity and approximability of several novel network flow and packing problems and presents combinatorial solution and approximation algorithms.
Citește tot Restrânge

Preț: 48197 lei

Nou

Puncte Express: 723
Preț estimativ în valută:
9224€ • 9516$ • 7806£

Carte tipărită la comandă

Livrare economică 04-18 martie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783658168117
ISBN-10: 3658168110
Pagini: 213
Ilustrații: XVI, 213 p. 26 illus.
Dimensiuni: 148 x 210 x 12 mm
Greutate: 0.28 kg
Ediția:1st ed. 2016
Editura: Springer Fachmedien Wiesbaden
Colecția Springer Spektrum
Locul publicării:Wiesbaden, Germany

Cuprins

Fractional Packing and Parametric Search Frameworks.- Budget-Constrained Minimum Cost Flows: The Continuous Case.- Budget-Constrained Minimum Cost Flows: The Discrete Case.- Generalized Processing Networks.- Convex Generalized Flows.

Notă biografică

Dr. Michael Holzhauser studied computer science at the University of Kaiserslautern and is now a research fellow in the Optimization Research Group at the Department of Mathematics of the University of Kaiserslautern. 

Textul de pe ultima copertă

Michael Holzhauser discusses generalizations of well-known network flow and packing problems by additional or modified side constraints. By exploiting the inherent connection between the two problem classes, the author investigates the complexity and approximability of several novel network flow and packing problems and presents combinatorial solution and approximation algorithms.

Contents
  • Fractional Packing and Parametric Search Frameworks
  • Budget-Constrained Minimum Cost Flows: The Continuous Case
  • Budget-Constrained Minimum Cost Flows: The Discrete Case
  • Generalized Processing Networks
  • Convex Generalized Flows
Target Groups
  • Researchers and students in the fields of mathematics, computer science, and economics
  • Practitioners in operations research and logistics
The Author
Dr. Michael Holzhauser studied computer science at the University of Kaiserslautern and is now a research fellow in the Optimization Research Group at the Department of Mathematics of the University of Kaiserslautern.

Caracteristici

A mathematical study Includes supplementary material: sn.pub/extras