Time-Dependent Path Scheduling: Algorithmic Minimization of Walking Time at the
68,59 €
He researches on modeling, complexity analysis, and algorithm design for the solution of various optimization problems. - Complexity Analyses, Combinatorial Properties, and Optimization Algorithms. About the Author:Helmut A. Sedding passed his doctoral thesis with distinction at the Institute of Theoretical Computer Science at Ulm University, Germany.
Jetzt bei Ebay:
