Ziegelmann mark (10 resultados)

Condición: New.

Paperback. Condición: Brand New. 76 pages. German language. 9.61x6.69x0.16 inches. In Stock.

Paperback. Condición: Brand New. 76 pages. German language. 9.61x6.69x0.16 inches. In Stock.

Taschenbuch. Condición: 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.…

Kartoniert / Broschiert. Condición: 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.…

Taschenbuch. Condición: 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.…

Condición: New. Print on Demand.

Condición: New. PRINT ON DEMAND.

Taschenbuch. Condición: Neu. Constrained Shortest Paths and Related Problems | Constrained Network Optimization | Mark Ziegelmann | Taschenbuch | 164 S. | Englisch | 2012 | AV Akademikerverlag | EAN 9783639445619 | Verantwortliche Person für die EU: BoD - Books on Demand, In de Tarpen 42, 22848 Norderstedt, info[at]bod[dot]de | Anbieter: preigu Print on Demand.…

Taschenbuch. Condición: 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.…