Articles liés à Constrained Shortest Paths and Related Problems: Constrained...
Constrained Shortest Paths and Related Problems: Constrained Network Optimization - Couverture souple
Synopsis
Revision with unchanged content. The shortest path problem arises in various applied settings where some material (e.g., computer data packet, telephone calls, vehicles) is sent between two specified points in a network as quickly, cheaply or reliably as possible. In practice we want to optimize a combination of those criteria (i.e., we have a bi- or multicriteria shortest path problem). This book proposes a 2-step method for the constrained shortest path problem. A relaxation is solved to get upper and lower bounds and then the gap is closed with clever path ranking to obtain the exact solution. Different old and new methods are compared both theoretically and experimentally. The proposed 2-step method also works for a more general class of constrained network optimization problems. In addition the generic approach is illustrated with several examples and a newly developed Constrained Network Optimization Software Package (CNOP) is introduced that provides this generic 2-step approach as well as all state of the art algorithms for constrained shortest paths. This book is a valuable resource for researchers, students as well as practitioners working on the constrained shortest path problem and related problems.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Acheter neuf
Afficher cet article
EUR 52,71
EUR 9,70 expédition depuis Allemagne vers France
Destinations, frais et délais
Résultats de recherche pour Constrained Shortest Paths and Related Problems: Constrained...
Image fournie par le vendeur
Constrained Shortest Paths and Related Problems
Edité par
AV Akademikerverlag, 2012
ISBN 10 : 3639445619
ISBN 13 : 9783639445619
Neuf
Kartoniert / Broschiert
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Kartoniert / Broschiert. Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Ziegelmann MarkDr. Mark Ziegelmann studied Computer Science at the Universities of Tuebingen, Edinburgh, and Saarbruecken and held a DFG doctoral stipend at the Max-Planck-Institute for Computer Science in the Algorithms and Complexiti. N° de réf. du vendeur 4988762
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Constrained Shortest Paths and Related Problems : Constrained Network Optimization
impression à la demandeVendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Revision with unchanged content. The shortest path problem arises in various applied settings where some material (e.g., computer data packet, telephone calls, vehicles) is sent between two specified points in a network as quickly, cheaply or reliably as possible. In practice we want to optimize a combination of those criteria (i.e., we have a bi- or multicriteria shortest path problem). This book proposes a 2-step method for the constrained shortest path problem. A relaxation is solved to get upper and lower bounds and then the gap is closed with clever path ranking to obtain the exact solution. Different old and new methods are compared both theoretically and experimentally. The proposed 2-step method also works for a more general class of constrained network optimization problems. In addition the generic approach is illustrated with several examples and a newly developed Constrained Network Optimization Software Package (CNOP) is introduced that provides this generic 2-step approach as well as all state of the art algorithms for constrained shortest paths. This book is a valuable resource for researchers, students as well as practitioners working on the constrained shortest path problem and related problems. N° de réf. du vendeur 9783639445619
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Constrained Shortest Paths and Related Problems
Edité par
AV Akademikerverlag Jul 2012, 2012
ISBN 10 : 3639445619
ISBN 13 : 9783639445619
Neuf
Taschenbuch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Revision with unchanged content. The shortest path problem arises in various applied settings where some material (e.g., computer data packet, telephone calls, vehicles) is sent between two specified points in a network as quickly, cheaply or reliably as possible. In practice we want to optimize a combination of those criteria (i.e., we have a bi- or multicriteria shortest path problem). This book proposes a 2-step method for the constrained shortest path problem. A relaxation is solved to get upper and lower bounds and then the gap is closed with clever path ranking to obtain the exact solution. Different old and new methods are compared both theoretically and experimentally. The proposed 2-step method also works for a more general class of constrained network optimization problems. In addition the generic approach is illustrated with several examples and a newly developed Constrained Network Optimization Software Package (CNOP) is introduced that provides this generic 2-step approach as well as all state of the art algorithms for constrained shortest paths. This book is a valuable resource for researchers, students as well as practitioners working on the constrained shortest path problem and related problems. 164 pp. Englisch. N° de réf. du vendeur 9783639445619
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Constrained Shortest Paths and Related Problems
Edité par
AV Akademikerverlag Jul 2012, 2012
ISBN 10 : 3639445619
ISBN 13 : 9783639445619
Neuf
Taschenbuch
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -Revision with unchanged content. The shortest path problem arises in various applied settings where some material (e.g., computer data packet, telephone calls, vehicles) is sent between two specified points in a network as quickly, cheaply or reliably as possible. In practice we want to optimize a combination of those criteria (i.e., we have a bi- or multicriteria shortest path problem). This book proposes a 2-step method for the constrained shortest path problem. A relaxation is solved to get upper and lower bounds and then the gap is closed with clever path ranking to obtain the exact solution. Different old and new methods are compared both theoretically and experimentally. The proposed 2-step method also works for a more general class of constrained network optimization problems. In addition the generic approach is illustrated with several examples and a newly developed Constrained Network Optimization Software Package (CNOP) is introduced that provides this generic 2-step approach as well as all state of the art algorithms for constrained shortest paths. This book is a valuable resource for researchers, students as well as practitioners working on the constrained shortest path problem and related problems.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 164 pp. Englisch. N° de réf. du vendeur 9783639445619
Quantité disponible : 1 disponible(s)