Transportation under nasty side constraints

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

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.
Original languageEnglish
Title of host publicationMathematical Foundations of Computer Science 2012 (37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings)
EditorsB. Rovan, V. Sassone, P. Widmayer
Place of PublicationBerlin
PublisherSpringer
Pages61-62
ISBN (Print)978-3-642-32588-5
DOIs
Publication statusPublished - 2012
Event37th International Symposium on Mathematical Foundations of Computer Science (MFCS 2012) - Bratislava, Slovakia
Duration: 27 Aug 201231 Aug 2012
Conference number: 37

Publication series

NameLecture Notes in Computer Science
Volume7464
ISSN (Print)0302-9743

Conference

Conference37th International Symposium on Mathematical Foundations of Computer Science (MFCS 2012)
Abbreviated titleMFCS 2012
CountrySlovakia
CityBratislava
Period27/08/1231/08/12

Fingerprint Dive into the research topics of 'Transportation under nasty side constraints'. Together they form a unique fingerprint.

Cite this