TU Berlin

Felix KönigPublications at COGA, TU Berlin

Inhalt

zur Navigation

Es gibt keine deutsche Übersetzung dieser Webseite.

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 zur Publikation Link zur Originalpublikation Download Bibtex Eintrag

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 zur Publikation Link zur Originalpublikation Download Bibtex Eintrag

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 zur Publikation Link zur Originalpublikation Download Bibtex Eintrag

Multi-dimensional commodity covering for tariff selection in transportation.

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

In Daniel Delling and Leo Liberti (ed.)12th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, OpenAccess Series in Informatics (OASIcs), Vol. 25, pp. 58–70, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2012.

Download Bibtex Eintrag

1D Vehicle Scheduling with Conflicts.

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

In Proceedings of the Workshop on Algorithm Engineering and Experiments, ALENEX 2011, pp. 107-115, Society for Industrial and Applied Mathematics, 2011.

Download Bibtex Eintrag

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

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

In Approximation and Online Algorithms: 7th International Workshop, WAOA 2009, Lecture Notes in Computer Science, Vol. 5893, pp. 170-181, Springer, 2010.

Download Bibtex Eintrag

The Bin Scheduling Problem.

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

In Proceedings of the 9th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP 2009), 2009.

Download Bibtex Eintrag

Sorting with Complete Networks of Stacks.

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

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

Download Bibtex Eintrag

Traffic Optimization under Route Constraints with Lagrangian Relaxation and Cutting Plane Methods.

König, Felix G.

In Operations Research Proceedings 2006, pp. 53-59, Springer, 2007.

Download Bibtex Eintrag

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

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

Download Bibtex Eintrag

Nach oben

Preprints

A Multi-Dimensional Multi-Commodity Covering Problem with Applications in Logistics
Zitatschlüssel Report-009-2012
Autor König, Felix G. and Matuschke, Jannik and Richter, Alexander
Jahr 2012
Nummer 009
Zusammenfassung In this paper, we study a multi-commodity multi-dimensional 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 now 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 set cover 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. Thus, in a second part 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. 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.
Typ der Publikation Preprint
Link zur Publikation Download Bibtex Eintrag

Nach oben

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 zur Publikation Download Bibtex Eintrag

Nach oben

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 Eintrag

Nach oben

Navigation

Direktzugang

Schnellnavigation zur Seite über Nummerneingabe