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. © 2012 Springer-Verlag.
CITATION STYLE
Woeginger, G. J. (2012). Transportation under nasty side constraints. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7464 LNCS, pp. 61–62). https://doi.org/10.1007/978-3-642-32589-2_7
Mendeley helps you to discover research relevant for your work.