direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Page Content

Publications

Scheduling and Packing Malleable and Parallel Tasks with Precedence Constraints of Bounded Width.

Günther, Elisabeth and König, Felix G. and Megow, Nicole

Journal of Combinatorial Optimization, Vol. 27, pp. 164-181, 2014.

Link to publication Link to original publication Download Bibtex entry

Approximation Algorithms for Capacitated Location Routing.

Harks, Tobias and Matuschke, Jannik and König, Felix G.

Transportation Science, Vol. 47, pp. 3-22, 2013.

Link to publication Link to original publication Download Bibtex entry

Integrated Sequencing and Scheduling in Coil Coating.

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

Management Science, Vol. 57, pp. 647–666, 2011.

Finalist for the EURO Excellence in Practice Award 2009.

Link to publication Link to original publication Download Bibtex entry

Multi-dimensional commodity covering for tariff selection in transportation
Citation key KoenigMatuschkeRichter2012
Author König, Felix G. and Matuschke, Jannik and Richter, Alexander
Title of Book 12th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems
Pages 58–70
Year 2012
Volume 25
Editor Daniel Delling and Leo Liberti
Publisher Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik
Series OpenAccess Series in Informatics (OASIcs)
Abstract In this paper, we study a multi-dimensional commodity covering problem, which we encountered as a subproblem in optimizing large scale transportation networks in logistics. The problem asks for a selection of containers for transporting a given set of commodities, each commodity having different extensions of properties such as weight or volume. Each container can be selected multiple times and is specified by a fixed charge and capacities in the relevant properties. The task is to find a cost minimal collection of containers and a feasible assignment of the demand to all selected containers. From theoretical point of view, by exploring similarities to the well known SetCover problem, we derive NP-hardness and see that the non-approximability result known for set cover also carries over to our problem. For practical applications we need very fast heuristics to be integrated into a meta-heuristic framework that - depending on the context - either provide feasible near optimal solutions or only estimate the cost value of an optimal solution. We develop and analyze a flexible family of greedy algorithms that meet these challenges. In order to find best-performing configurations for different requirements of the meta-heuristic framework, we provide an extensive computational study on random and real world instance sets obtained from our project partner 4flow AG. We outline a trade-off between running times and solution quality and conclude that the proposed methods achieve the accuracy and efficiency necessary for serving as a key ingredient in more complex meta-heuristics enabling the optimization of large-scale networks.
Link to publication Link to original publication Download Bibtex entry

To top

Preprints

An Integrated Approach to Tactical Logistics Network Optimization.

Harks, Tobias and König, Felix G. and Matuschke, Jannik and Richter, Alexander and Schulz, Jens

Preprint 034, Technische Universität Berlin, Institut für Mathematik, 2012.

Link to publication Download Bibtex entry

A Multi-Dimensional Multi-Commodity Covering Problem with Applications in Logistics.

König, Felix G. and Matuschke, Jannik and Richter, Alexander

Preprint 009, 2012.

Link to publication Download Bibtex entry

1D Vehicle Scheduling with Conflicts.

Gellert, Torsten J. and König, Felix G.

Preprint 022, Technische Universität Berlin, Institut für Mathematik, 2010.

Link to publication Download Bibtex entry

Approximation Algorithms for Capacitated Location Routing.

Harks, Tobias and König, Felix G. and Matuschke, Jannik

Preprint 010, Technische Universität Berlin, Institut für Mathematik, 2010.

Link to publication Download Bibtex entry

Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width.

Günther, Elisabeth and König, Felix G. and Megow, Nicole

Preprint 020, Technische Universität Berlin, Institut für Mathematik, 2009.

Approximation and Online Algorithms: 7th International Workshop, WAOA 2009, to appear as a volume of Lecture Notes in Computer Science, Springer-Verlag, 2009..

Link to publication Download Bibtex entry

Sequencing and Scheduling in Coil Coating with Shuttles.

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

Preprint 001, Technische Universität Berlin, Institut für Mathematik, 2009.

Published in Management Science 2011.

Link to publication Download Bibtex entry

Sorting with Complete Networks of Stacks.

König, Felix G. and Lübbecke, Marco E.

Preprint 036, Technische Universität Berlin, Institut für Mathematik, 2007.

Algorithms and Computation: 19th International Symposium, ISAAC 2008, volume 5369 of Lecture Notes in Computer Science, pp. 896-907, Springer-Verlag, 2008..

Link to publication Download Bibtex entry

Solutions to Real-World Instances of PSPACE-Complete Stacking.

König, Felix G. and Lübbecke, Marco E. and Möhring, Rolf H. and Schäfer, Guido and Spenke, Ines

Preprint 004, Technische Universität Berlin, Institut für Mathematik, 2007.

Algorithms - ESA 2007: 15th Annual European Symposium, volume 4698 of Lecture Notes in Computer Science, pp. 729-740, Springer-Verlag, 2007..

Link to publication Download Bibtex entry

To top

Doctoral Thesis

Sorting with Objectives - Graph Theoretic Concepts in Industrial Optimization.

König, Felix G.

Doctoral thesis, Technische Universität Berlin, 2009.

Supervisors: Rolf H. Möhring and Peter Widmayer.

Link to publication Download Bibtex entry

To top

Diploma Thesis

Verkehrsoptimierung unter Routennebenbedingungen mit Lagrange-Relaxation und Schnittebenenverfahren.

König, Felix G.

Diploma thesis, Technische Universität Berlin, 2005.

Supervisor: Rolf H. Möhring. Won the GOR-Diplomarbeitspreis 2006 (Master Thesis Award of the German Association for Operations Research). In German.

Download Bibtex entry

To top

Zusatzinformationen / Extras

Quick Access:

Schnellnavigation zur Seite über Nummerneingabe

Auxiliary Functions