Transportation under Nasty Side Constraints

  • Gerhard J. Woeginger
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7464)


The talk discusses planning problems where a set of items has to be transported from location A to location B subject to certain collision and/or resource constraints. We analyze the behavior of these problems, discuss their history, and derive some of their combinatorial and algorithmic properties.


Motion Planning Transportation Problem Discrete Mathematic Vertex Cover Feasible Schedule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Csorba, P., Hurkens, C.A.J., Woeginger, G.J.: The Alcuin number of a graph and its connections to the vertex cover number. SIAM Journal on Discrete Mathematics 24, 757–769 (2010)MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Eggermont, C., Woeginger, G.J.: Motion planning with pulley, rope, and baskets. In: Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics, vol. 14, pp. 374–383 (2012)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Gerhard J. Woeginger
    • 1
  1. 1.Department of Mathematics and Computer ScienceTU EindhovenNetherlands

Personalised recommendations