DROPS

Volume

OASIcs, Volume 2

5th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'05)

ATMOS 2005, October 7, 2005, Palma de Mallorca, Spain

Editors: Leo G. Kroon and Rolf H. Möhring

Document

DOI: 10.4230/LIPIcs.SEA.2024.14

Accelerating ILP Solvers for Minimum Flow Decompositions Through Search Space and Dimensionality Reductions

Authors: Andreas Grigorjew, Fernando H. C. Dias, Andrea Cracco, Romeo Rizzi, and Alexandru I. Tomescu

Published in: LIPIcs, Volume 301, 22nd International Symposium on Experimental Algorithms (SEA 2024)

Abstract

Given a flow network, the Minimum Flow Decomposition (MFD) problem is finding the smallest possible set of weighted paths whose superposition equals the flow. It is a classical, strongly NP-hard problem that is proven to be useful in RNA transcript assembly and applications outside of Bioinformatics. We improve an existing ILP (Integer Linear Programming) model by Dias et al. [RECOMB 2022] for DAGs by decreasing the solver’s search space using solution safety and several other optimizations. This results in a significant speedup compared to the original ILP, of up to 34× on average on the hardest instances. Moreover, we show that our optimizations apply also to MFD problem variants, resulting in speedups that go up to 219× on the hardest instances. We also developed an ILP model of reduced dimensionality for an MFD variant in which the solution path weights are restricted to a given set. This model can find an optimal MFD solution for most instances, and overall, its accuracy significantly outperforms that of previous greedy algorithms while being up to an order of magnitude faster than our optimized ILP.

Cite as

Andreas Grigorjew, Fernando H. C. Dias, Andrea Cracco, Romeo Rizzi, and Alexandru I. Tomescu. Accelerating ILP Solvers for Minimum Flow Decompositions Through Search Space and Dimensionality Reductions. In 22nd International Symposium on Experimental Algorithms (SEA 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 301, pp. 14:1-14:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)

Copy BibTex To Clipboard

@InProceedings{grigorjew_et_al:LIPIcs.SEA.2024.14,
  author =	{Grigorjew, Andreas and Dias, Fernando H. C. and Cracco, Andrea and Rizzi, Romeo and Tomescu, Alexandru I.},
  title =	{{Accelerating ILP Solvers for Minimum Flow Decompositions Through Search Space and Dimensionality Reductions}},
  booktitle =	{22nd International Symposium on Experimental Algorithms (SEA 2024)},
  pages =	{14:1--14:19},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-325-6},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{301},
  editor =	{Liberti, Leo},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.14},
  URN =		{urn:nbn:de:0030-drops-203792},
  doi =		{10.4230/LIPIcs.SEA.2024.14},
  annote =	{Keywords: Flow decomposition, Integer Linear Programming, Safety, RNA-seq, RNA transcript assembly, isoform}
}

Document

Track B: Automata, Logic, Semantics, and Theory of Programming

DOI: 10.4230/LIPIcs.ICALP.2024.147

Smoothed Analysis of Deterministic Discounted and Mean-Payoff Games

Authors: Bruno Loff and Mateusz Skomra

Published in: LIPIcs, Volume 297, 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)

Abstract

We devise a policy-iteration algorithm for deterministic two-player discounted and mean-payoff games, that runs in polynomial time with high probability, on any input where each payoff is chosen independently from a sufficiently random distribution and the underlying graph of the game is ergodic. This includes the case where an arbitrary set of payoffs has been perturbed by a Gaussian, showing for the first time that deterministic two-player games can be solved efficiently, in the sense of smoothed analysis. More generally, we devise a condition number for deterministic discounted and mean-payoff games played on ergodic graphs, and show that our algorithm runs in time polynomial in this condition number. Our result confirms a previous conjecture of Boros et al., which was claimed as a theorem [Boros et al., 2011] and later retracted [Boros et al., 2018]. It stands in contrast with a recent counter-example by Christ and Yannakakis [Christ and Yannakakis, 2023], showing that Howard’s policy-iteration algorithm does not run in smoothed polynomial time on stochastic single-player mean-payoff games. Our approach is inspired by the analysis of random optimal assignment instances by Frieze and Sorkin [Frieze and Sorkin, 2007], and the analysis of bias-induced policies for mean-payoff games by Akian, Gaubert and Hochart [Akian et al., 2018].

Cite as

Bruno Loff and Mateusz Skomra. Smoothed Analysis of Deterministic Discounted and Mean-Payoff Games. In 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 297, pp. 147:1-147:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)

Copy BibTex To Clipboard

@InProceedings{loff_et_al:LIPIcs.ICALP.2024.147,
  author =	{Loff, Bruno and Skomra, Mateusz},
  title =	{{Smoothed Analysis of Deterministic Discounted and Mean-Payoff Games}},
  booktitle =	{51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
  pages =	{147:1--147:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-322-5},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{297},
  editor =	{Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.147},
  URN =		{urn:nbn:de:0030-drops-202908},
  doi =		{10.4230/LIPIcs.ICALP.2024.147},
  annote =	{Keywords: Mean-payoff games, discounted games, policy iteration, smoothed analysis}
}

Document

Complete Volume

DOI: 10.4230/OASIcs.ATMOS.2005

OASIcs, Volume 2, ATMOS'05, Complete Volume

Authors: Leo G. Kroon and Rolf H. Möhring

Published in: OASIcs, Volume 2, 5th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'05) (2006)

Abstract

OASIcs, Volume 2, ATMOS'05, Complete Volume

Cite as

5th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'05). Open Access Series in Informatics (OASIcs), Volume 2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)

Copy BibTex To Clipboard

@Proceedings{kroon_et_al:OASIcs.ATMOS.2005,
  title =	{{OASIcs, Volume 2, ATMOS'05, Complete Volume}},
  booktitle =	{5th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'05)},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-00-2},
  ISSN =	{2190-6807},
  year =	{2012},
  volume =	{2},
  editor =	{Kroon, Leo G. and M\"{o}hring, Rolf H.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2005},
  URN =		{urn:nbn:de:0030-drops-35642},
  doi =		{10.4230/OASIcs.ATMOS.2005},
  annote =	{Keywords: Analysis of Algorithms and Problem Complexity, Optimization, Graph Theory, Applications}
}

Document

DOI: 10.4230/DagSemProc.10071.1

10071 Abstracts Collection – Scheduling

Authors: Susanne Albers, Sanjoy K. Baruah, Rolf H. Möhring, and Kirk Pruhs

Published in: Dagstuhl Seminar Proceedings, Volume 10071, Scheduling (2010)

Abstract

From 14.02. to 19.02.2010, the Dagstuhl Seminar 10071 ``Scheduling '' was held in Schloss Dagstuhl-Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.

Cite as

Susanne Albers, Sanjoy K. Baruah, Rolf H. Möhring, and Kirk Pruhs. 10071 Abstracts Collection – Scheduling. In Scheduling. Dagstuhl Seminar Proceedings, Volume 10071, pp. 1-12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)

Copy BibTex To Clipboard

@InProceedings{albers_et_al:DagSemProc.10071.1,
  author =	{Albers, Susanne and Baruah, Sanjoy K. and M\"{o}hring, Rolf  H. and Pruhs, Kirk},
  title =	{{10071 Abstracts Collection – Scheduling}},
  booktitle =	{Scheduling},
  pages =	{1--12},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2010},
  volume =	{10071},
  editor =	{Susanne Albers and Sanjoy K. Baruah and Rolf H. M\"{o}hring and Kirk Pruhs},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.10071.1},
  URN =		{urn:nbn:de:0030-drops-25479},
  doi =		{10.4230/DagSemProc.10071.1},
  annote =	{Keywords: Scheduling, real-time, complexity, approximation algorithms}
}

Document

DOI: 10.4230/DagSemProc.10071.2

10071 Executive Summary – Scheduling

Authors: Susanne Albers, Sanjoy K. Baruah, Rolf H. Möhring, and Kirk Pruhs

Published in: Dagstuhl Seminar Proceedings, Volume 10071, Scheduling (2010)

Abstract

The primary objectives of this seminar were to bring together leading researchers working on scheduling problems in three different research communities – operations research, theoretical computer science, and real-time systems – to expose each community to the important problems addressed by the other communities; to enable and encourage cooperation among the researchers; and to facilitate a transfer of solution techniques from each community to the others.

Cite as

Susanne Albers, Sanjoy K. Baruah, Rolf H. Möhring, and Kirk Pruhs. 10071 Executive Summary – Scheduling. In Scheduling. Dagstuhl Seminar Proceedings, Volume 10071, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)

Copy BibTex To Clipboard

@InProceedings{albers_et_al:DagSemProc.10071.2,
  author =	{Albers, Susanne and Baruah, Sanjoy K. and M\"{o}hring, Rolf  H. and Pruhs, Kirk},
  title =	{{10071 Executive Summary – Scheduling}},
  booktitle =	{Scheduling},
  pages =	{1--2},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2010},
  volume =	{10071},
  editor =	{Susanne Albers and Sanjoy K. Baruah and Rolf H. M\"{o}hring and Kirk Pruhs},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.10071.2},
  URN =		{urn:nbn:de:0030-drops-25417},
  doi =		{10.4230/DagSemProc.10071.2},
  annote =	{Keywords: Scheduling, real-time, complexity, approximation algorithms}
}

Document

DOI: 10.4230/DagSemProc.09261.1

09261 Abstracts Collection – Models and Algorithms for Optimization in Logistics

Authors: Cynthia Barnhart, Uwe Clausen, Ulrich Lauther, and Rolf H. Möhring

Published in: Dagstuhl Seminar Proceedings, Volume 9261, Models and Algorithms for Optimization in Logistics (2009)

Abstract

From June 21 to June 26, 2009 the Dagstuhl Seminar Perspectives Workshop 09261 ``Models and Algorithms for Optimization in Logistics '' was held in Schloss Dagstuhl~--~Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.

Cite as

Cynthia Barnhart, Uwe Clausen, Ulrich Lauther, and Rolf H. Möhring. 09261 Abstracts Collection – Models and Algorithms for Optimization in Logistics. In Models and Algorithms for Optimization in Logistics. Dagstuhl Seminar Proceedings, Volume 9261, pp. 1-18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{barnhart_et_al:DagSemProc.09261.1,
  author =	{Barnhart, Cynthia and Clausen, Uwe and Lauther, Ulrich and M\"{o}hring, Rolf H.},
  title =	{{09261 Abstracts Collection – Models and Algorithms for Optimization in Logistics }},
  booktitle =	{Models and Algorithms for Optimization in Logistics},
  pages =	{1--18},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9261},
  editor =	{Cynthia Barnhart and Uwe Clausen and Ulrich Lauther and Rolf H. M\"{o}hring},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09261.1},
  URN =		{urn:nbn:de:0030-drops-21915},
  doi =		{10.4230/DagSemProc.09261.1},
  annote =	{Keywords: Logistics, optimization, transport}
}

Document

DOI: 10.4230/DagSemProc.09261.2

09261 Executive Summary – Models and Algorithms for Optimization in Logistics

Authors: Cynthia Barnhart, Uwe Clausen, Ulrich Lauther, and Rolf H. Möhring

Published in: Dagstuhl Seminar Proceedings, Volume 9261, Models and Algorithms for Optimization in Logistics (2009)

Abstract

From June 21 to June 26, 2009, the Dagstuhl Seminar 09261 on Models and Algorithms for Optimization in Logistics was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.

Cite as

Cynthia Barnhart, Uwe Clausen, Ulrich Lauther, and Rolf H. Möhring. 09261 Executive Summary – Models and Algorithms for Optimization in Logistics. In Models and Algorithms for Optimization in Logistics. Dagstuhl Seminar Proceedings, Volume 9261, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{barnhart_et_al:DagSemProc.09261.2,
  author =	{Barnhart, Cynthia and Clausen, Uwe and Lauther, Ulrich and M\"{o}hring, Rolf H.},
  title =	{{09261 Executive Summary – Models and Algorithms for Optimization in Logistics}},
  booktitle =	{Models and Algorithms for Optimization in Logistics},
  pages =	{1--2},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9261},
  editor =	{Cynthia Barnhart and Uwe Clausen and Ulrich Lauther and Rolf H. M\"{o}hring},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09261.2},
  URN =		{urn:nbn:de:0030-drops-21752},
  doi =		{10.4230/DagSemProc.09261.2},
  annote =	{Keywords: Logistics, optimization, transport}
}

Document

DOI: 10.4230/DagSemProc.09261.26

Sequencing and Scheduling in Coil Coating with Shuttles

Authors: Wiebke Höhn, Felix G. König, Marco E. Lübbecke, and Rolf H. Möhring

Published in: Dagstuhl Seminar Proceedings, Volume 9261, Models and Algorithms for Optimization in Logistics (2009)

Abstract

Applying combinatorial optimization in real life yields cost savings delighting the industry. Beyond that, at the core of some applications also lies a pretty (sub)problem rejoicing the mathematician. In our application coils of sheet metal are coated with k layers out of hundreds of colors. Coils are stapled together to run through k coaters, and non-productive time occurs e.g. when the color in a coater needs to be changed. Some coaters have two parallel tanks, enabling either parallel colors or cleaning of one tank during production. We present our sequencing and scheduling scheme in use at the plant today, lower bounds proving solution quality, and problems in the edge-wise union of interval graphs as a pretty mathematical subproblem.

Cite as

Wiebke Höhn, Felix G. König, Marco E. Lübbecke, and Rolf H. Möhring. Sequencing and Scheduling in Coil Coating with Shuttles. In Models and Algorithms for Optimization in Logistics. Dagstuhl Seminar Proceedings, Volume 9261, pp. 1-29, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{hohn_et_al:DagSemProc.09261.26,
  author =	{H\"{o}hn, Wiebke and K\"{o}nig, Felix G. and L\"{u}bbecke, Marco E. and M\"{o}hring, Rolf H.},
  title =	{{Sequencing and Scheduling in Coil Coating with Shuttles}},
  booktitle =	{Models and Algorithms for Optimization in Logistics},
  pages =	{1--29},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9261},
  editor =	{Cynthia Barnhart and Uwe Clausen and Ulrich Lauther and Rolf H. M\"{o}hring},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09261.26},
  URN =		{urn:nbn:de:0030-drops-21654},
  doi =		{10.4230/DagSemProc.09261.26},
  annote =	{Keywords: Sequencing, scheduling, coil coating, mutli-interval graphs, heuristics, branch and price}
}

Document

DOI: 10.4230/DagSemProc.08071.1

08071 Abstracts Collection – Scheduling

Authors: Jane W. S. Liu, Rolf H. Möhring, and Kirk Pruhs

Published in: Dagstuhl Seminar Proceedings, Volume 8071, Scheduling (2008)

Abstract

From 10.02. to 15.02., the Dagstuhl Seminar 08071 ``Scheduling'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.

Cite as

Jane W. S. Liu, Rolf H. Möhring, and Kirk Pruhs. 08071 Abstracts Collection – Scheduling. In Scheduling. Dagstuhl Seminar Proceedings, Volume 8071, pp. 1-20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)

Copy BibTex To Clipboard

@InProceedings{liu_et_al:DagSemProc.08071.1,
  author =	{Liu, Jane W. S. and M\"{o}hring, Rolf H. and Pruhs, Kirk},
  title =	{{08071 Abstracts Collection – Scheduling}},
  booktitle =	{Scheduling},
  pages =	{1--20},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{8071},
  editor =	{Jane W. S. Liu and Rolf H. M\"{o}hring and Kirk Pruhs},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.08071.1},
  URN =		{urn:nbn:de:0030-drops-14897},
  doi =		{10.4230/DagSemProc.08071.1},
  annote =	{Keywords: Scheduling, real-time, supply chain}
}

Document

DOI: 10.4230/DagSemProc.08071.2

08071 Executive Summary – Scheduling

Authors: Jane W. S. Liu, Rolf H. Möhring, and Kirk Pruhs

Published in: Dagstuhl Seminar Proceedings, Volume 8071, Scheduling (2008)

Abstract

Scheduling is a form of decision making that involves allocating scarce resources to achieve some objective. The study of scheduling dates back to at least the 1950’s when operations research researchers studied problems of managing activities in a workshop. Computer systems researchers started studying scheduling in the 1960’s in the development of operating systems and time-critical applications.

Cite as

Jane W. S. Liu, Rolf H. Möhring, and Kirk Pruhs. 08071 Executive Summary – Scheduling. In Scheduling. Dagstuhl Seminar Proceedings, Volume 8071, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)

Copy BibTex To Clipboard

@InProceedings{liu_et_al:DagSemProc.08071.2,
  author =	{Liu, Jane W. S. and M\"{o}hring, Rolf H. and Pruhs, Kirk},
  title =	{{08071 Executive Summary – Scheduling}},
  booktitle =	{Scheduling},
  pages =	{1--2},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{8071},
  editor =	{Jane W. S. Liu and Rolf H. M\"{o}hring and Kirk Pruhs},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.08071.2},
  URN =		{urn:nbn:de:0030-drops-14871},
  doi =		{10.4230/DagSemProc.08071.2},
  annote =	{Keywords: Scheduling, real-time, supply chain}
}

Document

DOI: 10.4230/OASIcs.ATMOS.2005.668

ATMOS 2005 Abstracts Collection -- Selected Papers from the 5th Workshop on Algorithmic Methods and Models for Optimization of Railways

Authors: Leo G. Kroon and Rolf H. Möhring

Published in: OASIcs, Volume 2, 5th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'05) (2006)

Abstract

This issue contains six papers that were presented in preliminary form at the 5th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS 2005), held at Palma de Mallorca, Spain, October 7, 2005 in conjunction with ALGO 2005. These papers are representative of several areas of research within the scope of ATMOS: rolling stock circulation and engine assignment, station location, line planning, railway traffic scheduling and dispatching, transfer optimization within network design, and fast traffic information systems.

Cite as

Leo G. Kroon and Rolf H. Möhring. ATMOS 2005 Abstracts Collection -- Selected Papers from the 5th Workshop on Algorithmic Methods and Models for Optimization of Railways. In 5th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'05). Open Access Series in Informatics (OASIcs), Volume 2, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{kroon_et_al:OASIcs.ATMOS.2005.668,
  author =	{Kroon, Leo G. and M\"{o}hring, Rolf H.},
  title =	{{ATMOS 2005 Abstracts Collection -- Selected Papers from the 5th Workshop on Algorithmic Methods and Models for Optimization of Railways}},
  booktitle =	{5th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'05)},
  pages =	{1--4},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-00-2},
  ISSN =	{2190-6807},
  year =	{2006},
  volume =	{2},
  editor =	{Kroon, Leo G. and M\"{o}hring, Rolf H.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2005.668},
  URN =		{urn:nbn:de:0030-drops-6688},
  doi =		{10.4230/OASIcs.ATMOS.2005.668},
  annote =	{Keywords: Railway traffic, networks, algorithms, optimization}
}

Document

Front Matter

DOI: 10.4230/OASIcs.ATMOS.2005.656

ATMOS Preface -- Algorithmic Methods and Models for Optimization of Railways

Authors: Leo G. Kroon and Rolf H. Möhring

Published in: OASIcs, Volume 2, 5th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'05) (2006)

Abstract

This issue contains six papers that were presented in preliminary form at the 5th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS 2005), held at Palma de Mallorca, Spain, October 7, 2005 in conjunction with ALGO 2005. These papers are representative of several areas of research within the scope of ATMOS: rolling stock circulation and engine assignment, station location, line planning, railway traffic scheduling and dispatching, transfer optimization within network design, and fast traffic information systems.

Cite as

5th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'05). Open Access Series in Informatics (OASIcs), Volume 2, pp. i-vi, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{kroon_et_al:OASIcs.ATMOS.2005.656,
  author =	{Kroon, Leo G. and M\"{o}hring, Rolf H.},
  title =	{{ATMOS  Preface -- Algorithmic Methods and Models for Optimization of Railways}},
  booktitle =	{5th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'05)},
  pages =	{i--vi},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-00-2},
  ISSN =	{2190-6807},
  year =	{2006},
  volume =	{2},
  editor =	{Kroon, Leo G. and M\"{o}hring, Rolf H.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2005.656},
  URN =		{urn:nbn:de:0030-drops-6565},
  doi =		{10.4230/OASIcs.ATMOS.2005.656},
  annote =	{Keywords: Railway traffic, networks, algorithms, optimization}
}

Document

DOI: 10.4230/DagSemProc.05031.1

05031 Abstracts Collection – Algorithms for Optimization with Incomplete Information

Authors: Susanne Albers, Rolf H. Möhring, Georg Ch. Pflug, and Rüdiger Schultz

Published in: Dagstuhl Seminar Proceedings, Volume 5031, Algorithms for Optimization with Incomplete Information (2005)

Abstract

From 16.01.05 to 21.01.05, the Dagstuhl Seminar 05031 ``Algorithms for Optimization with Incomplete Information'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.

Cite as

Susanne Albers, Rolf H. Möhring, Georg Ch. Pflug, and Rüdiger Schultz. 05031 Abstracts Collection – Algorithms for Optimization with Incomplete Information. In Algorithms for Optimization with Incomplete Information. Dagstuhl Seminar Proceedings, Volume 5031, pp. 1-25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{albers_et_al:DagSemProc.05031.1,
  author =	{Albers, Susanne and M\"{o}hring, Rolf H. and Pflug, Georg Ch. and Schultz, R\"{u}diger},
  title =	{{05031 Abstracts Collection  – Algorithms for Optimization with Incomplete Information}},
  booktitle =	{Algorithms for Optimization with Incomplete Information},
  pages =	{1--25},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{5031},
  editor =	{Susanne Albers and Rolf H. M\"{o}hring and Georg Ch. Pflug and R\"{u}diger Schultz},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05031.1},
  URN =		{urn:nbn:de:0030-drops-1948},
  doi =		{10.4230/DagSemProc.05031.1},
  annote =	{Keywords: Online optimization , robust optimization , stochastic programming , stochastic scheduling}
}

Document

DOI: 10.4230/DagSemProc.05031.2

05031 Summary – Algorithms for Optimization with Incomplete Information

Authors: Susanne Albers, Rolf H. Möhring, Georg Ch. Pflug, and Rüdiger Schultz

Published in: Dagstuhl Seminar Proceedings, Volume 5031, Algorithms for Optimization with Incomplete Information (2005)

Abstract

This paper summarizes the objectives and structure of a seminar with the same title, held from January 16th to 21th 2005 at Schloss Dagstuhl, Germany

Cite as

Susanne Albers, Rolf H. Möhring, Georg Ch. Pflug, and Rüdiger Schultz. 05031 Summary – Algorithms for Optimization with Incomplete Information. In Algorithms for Optimization with Incomplete Information. Dagstuhl Seminar Proceedings, Volume 5031, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{albers_et_al:DagSemProc.05031.2,
  author =	{Albers, Susanne and M\"{o}hring, Rolf H. and Pflug, Georg Ch. and Schultz, R\"{u}diger},
  title =	{{05031 Summary – Algorithms for Optimization with Incomplete Information}},
  booktitle =	{Algorithms for Optimization with Incomplete Information},
  pages =	{1--2},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{5031},
  editor =	{Susanne Albers and Rolf H. M\"{o}hring and Georg Ch. Pflug and R\"{u}diger Schultz},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05031.2},
  URN =		{urn:nbn:de:0030-drops-1138},
  doi =		{10.4230/DagSemProc.05031.2},
  annote =	{Keywords: Online Optimization , Robust Optimization , Stochastic Programming , Stochastic Scheduling}
}

16 Search Results for "Möhring, Rolf H."

Abstract

Cite as

Abstract

Cite as

Abstract

Cite as

Abstract

Cite as

Abstract

Cite as

Abstract

Cite as

Abstract

Cite as

Abstract

Cite as

Abstract

Cite as

Abstract

Cite as

Abstract

Cite as

Abstract

Cite as

Abstract

Cite as

Abstract

Cite as