Transportation under nasty side constraints

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free