Transportation under nasty side constraints

G.J. Woeginger

doi:10.1007/978-3-642-32589-2_7

Transportation under nasty side constraints

G.J. Woeginger

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-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 language	English
Title of host publication	Mathematical Foundations of Computer Science 2012 (37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings)
Editors	B. Rovan, V. Sassone, P. Widmayer
Place of Publication	Berlin
Publisher	Springer
Pages	61-62
ISBN (Print)	978-3-642-32588-5
DOIs	https://doi.org/10.1007/978-3-642-32589-2_7
Publication status	Published - 2012
Event	37th International Symposium on Mathematical Foundations of Computer Science (MFCS 2012) - Bratislava, Slovakia Duration: 27 Aug 2012 → 31 Aug 2012 Conference number: 37

Publication series

Name	Lecture Notes in Computer Science
Volume	7464
ISSN (Print)	0302-9743

Conference

Conference	37th International Symposium on Mathematical Foundations of Computer Science (MFCS 2012)
Abbreviated title	MFCS 2012
Country/Territory	Slovakia
City	Bratislava
Period	27/08/12 → 31/08/12

Access to Document

10.1007/978-3-642-32589-2_7

Cite this

Woeginger, G. J. (2012). Transportation under nasty side constraints. In B. Rovan, V. Sassone, & P. Widmayer (Eds.), Mathematical Foundations of Computer Science 2012 (37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings) (pp. 61-62). (Lecture Notes in Computer Science; Vol. 7464). Springer. https://doi.org/10.1007/978-3-642-32589-2_7

@inproceedings{6994609e03894adab5bb7f47dcbedd8a,

title = "Transportation under nasty side constraints",

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.",

author = "G.J. Woeginger",

year = "2012",

doi = "10.1007/978-3-642-32589-2_7",

language = "English",

isbn = "978-3-642-32588-5",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "61--62",

editor = "B. Rovan and V. Sassone and P. Widmayer",

booktitle = "Mathematical Foundations of Computer Science 2012 (37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings)",

address = "Germany",

note = "37th International Symposium on Mathematical Foundations of Computer Science (MFCS 2012), MFCS 2012 ; Conference date: 27-08-2012 Through 31-08-2012",

}

Woeginger, GJ 2012, Transportation under nasty side constraints. in B Rovan, V Sassone & P Widmayer (eds), Mathematical Foundations of Computer Science 2012 (37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings). Lecture Notes in Computer Science, vol. 7464, Springer, Berlin, pp. 61-62, 37th International Symposium on Mathematical Foundations of Computer Science (MFCS 2012), Bratislava, Slovakia, 27/08/12. https://doi.org/10.1007/978-3-642-32589-2_7

Transportation under nasty side constraints. / Woeginger, G.J.

Mathematical Foundations of Computer Science 2012 (37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings). ed. / B. Rovan; V. Sassone; P. Widmayer. Berlin : Springer, 2012. p. 61-62 (Lecture Notes in Computer Science; Vol. 7464).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Transportation under nasty side constraints

AU - Woeginger, G.J.

N1 - Conference code: 37

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

U2 - 10.1007/978-3-642-32589-2_7

DO - 10.1007/978-3-642-32589-2_7

M3 - Conference contribution

SN - 978-3-642-32588-5

T3 - Lecture Notes in Computer Science

SP - 61

EP - 62

BT - Mathematical Foundations of Computer Science 2012 (37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings)

A2 - Rovan, B.

A2 - Sassone, V.

A2 - Widmayer, P.

PB - Springer

CY - Berlin

T2 - 37th International Symposium on Mathematical Foundations of Computer Science (MFCS 2012)

Y2 - 27 August 2012 through 31 August 2012

ER -

Transportation under nasty side constraints

Abstract

Publication series

Conference

Access to Document

Fingerprint

Cite this