Publikationen

Unsere wissenschaftlichen Veröffentlichungen.

110
Publikationen

Publikationen

2019
Buchheim, C., Crama, Y. and Rodríguez-Heck, E.
Berge-acyclic multilinear 0–1 optimization problems. European Journal of Operational Research, 273(1):102—107, February 2019.
Goderbauer, S. and Ermert, L.
Proportional Apportionment for Connected Coalitions. In Labbé, M. and Frotz, B., Operations Research 2018 Proceedings, January 2019. Springer International Publishing. In print.
2018
Büsing, C., Goderbauer, S., Koster, A.M.C.A. and Kutschka, M.
Formulations and Algorithms for the Recoverable Gamma-Robust Knapsack Problem. EURO Journal on Computational Optimization, October 2018. Online first.
Gauthier, J.-B., Desrosiers, J. and Lübbecke, M.
Vector Space Decomposition for Solving Large-Scale Linear Programs. Operations Research, 66(5):1376—1389, September 2018.
Witt, J.T., Lübbecke, M. and Reed, B.
Polyhedral results on the stable set problem in graphs containing even or odd pairs. Mathematical Programming, 171(1—2):519—522, August 2018.
Lübbecke, M. and Witt, J.T.
The strength of Dantzig–Wolfe reformulations for the stable set and related problems. Discrete Optimization, 30:168—187, August 2018.
Brinker, J., Ring, D., Lübbecke, M., Takeda, Y. and Corves, B.
Optimization of the Reconfiguration Planning of Cyber-Physical Production Systems with Delta-Like Architecture. Int. Conf. on Reconfigurable Mechanisms & Robots (ReMAR), June 2018. IEEE.
Bastubbe, M., Lübbecke, M. and Witt, J.T.
A Computational Investigation on the Strength of Dantzig-Wolfe Reformulations. In D'Angelo, G., Experimental Algorithms - SEA 2018, pages 11:1—11:12, May 2018. Schloss Dagstuhl-Leibniz-Zentrum für Informatik. Leibniz International Proceedings in Informatics (LIPIcs), vol. 103 (instances available at https://www.or.rwth-aachen.de/files/research/publications/alldecomps_instances.zip).
Ermel, D. and Walter, M.
Parity polytopes and binarization. Discrete Applied Mathematics, March 2018.
Brauer, C., Lorenz, D.A. and Tillmann, A.
A Primal-Dual Homotopy Algorithm for L1-Minimization With L-infinity-Constraints. Computational Optimization and Applications, 70(2):443—478, February 2018.
Fischer, T., Hegde, G., Matter, F., Pesavento, M., Pfetsch, M.E. and Tillmann, A.
Joint Antenna Selection and Phase-Only Beam Using Mixed-Integer Nonlinear Programming. to appear in Proc. WSA 2018, January 2018.
Boros, E., Crama, Y. and Rodríguez-Heck, E.
Quadratizations of symmetric pseudo-Boolean functions: sub-linear bounds on the number of auxiliary variables. Unpublished proceedings at the International Symposium on Artificial Intelligence and Mathematics (ISAIM) 2018, Fort Lauderdale, January 2018.
2017
Crama, Y. and Rodríguez-Heck, E.
A class of valid inequalities for multilinear 0-1 optimization problems. Discrete Optimization, 25:28—47, August 2017.
Gauthier, J.-B., Desrosiers, J. and Lübbecke, M.
A strongly polynomial Contraction-Expansion algorithm for network flow problems. Computers & Operations Research, 84:16—32, July 2017.
Brinker, J., Lübbecke, M., Takeda, Y. and Corves, B.
Optimization of the Reconfiguration Planning of Handling Systems based on Parallel Manipulators with Delta-Like Architecture. IEEE Robotics and Automation Letters, 2(3):1802—1808, June 2017.
Kruber, M., Lübbecke, M. and Parmentier, A.
Learning When to Use a Decomposition. In Salvagnin, D. and Lombardi, M., Integration of AI and OR Techniques in Constraint Programming, pages 202—210, May 2017. Springer. Lecture Notes in Computer Science, vol 10335.
Feldmeier, M. and Husslein, T.
Backbone Strategy for Unconstrained Continuous Optimization. Proceedings 31st European Conference on Modelling and Simulation, pages 529—533, April 2017.
Willamowski, F.J.L. and Bley, A.
Local Search Based Approximation Algorithms for Two-Stage Stochastic Location Problems. In Jansen, K. and Mastrolilli, M., Approximation and Online Algorithms (WAOA 2016), January 2017. Springer. Lecture Notes in Computer Science, vol 10138.
2016
Büsing, C., Kirchner, S., Koster, A.M.C.A. and Thome, A.
The Budgeted Minimum Cost Flow Problem with Unit Upgrading Cost. Networks, 69(1):67—82, December 2016.
Goderbauer, S., Bahl, B., Voll, P., Lübbecke, M., Bardow, A. and Koster, A.M.C.A.
An adaptive discretization MINLP algorithm for optimal synthesis of decentralized energy supply systems. Computers & Chemical Engineering, 95:38—48, November 2016.
Büsing, C., Kirchner, S. and Thome, A.
The Capacitated Budgeted Minimum Cost Flow Problem with Unit Upgrading Cost. Electronic Notes in Discrete Mathematics, 55:135—138, October 2016. 14th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW16).
Lange, J.-H., Pfetsch, M.E., Seib, B.M. and Tillmann, A.
Sparse Recovery with Integrality Constraints. arXiv:1608.08678 [cs.IT], RWTH Aachen, TU Darmstadt, August 2016.
Bohlin, M., Gestrelius, S., Dahms, F.H.W., Mihal, M. and Flier, H.
Optimization Methods for Multistage Freight Train Formation. Transportation Science, 50(3):823—840, July 2016.
Goderbauer, S.
Mathematische Optimierung der Wahlkreiseinteilung für die Deutsche Bundestagswahl: Modelle und Algorithmen für eine bessere Beachtung der gesetzlichen Vorgaben. Springer Spektrum, Wiesbaden, May 2016. Part of the BestMasters book series.
Gauthier, J.-B., Desrosiers, J. and Lübbecke, M.
Tools for primal degenerate linear programs: IPS, DCA, and PE. EURO Journal on Transportation and Logistics, 5(2):161—204, May 2016.
Walter, M.
Investigating Polyhedra by Oracles and Analyzing Simple Extensions of Polytopes. Dissertation, Otto-von-Guericke-Universität, April 2016.
Walter, M., Dey, S., Damci-Kurt, P. and Kücükyavuz, S.
On a cardinality-constrained transportation problem with market choice. Operations Research Letters, 44(2):170—173, February 2016.
2015
Bergner, M., Lübbecke, M. and Witt, J.T.
A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs. Journal of Experimental Algorithmics (JEA), 21:1.2:1—1.2:16, December 2015.
Goderbauer, S.
Political Districting for Elections to the German Bundestag: An Optimization-Based Multi-Stage Heuristic Respecting Administrative Boundaries. In Lübbecke, M., Koster, A.M.C.A., Letmathe, P., Madlener, R., Peis, B. and Walther, G., Operations Research Proceedings 2014, pages 181—187, December 2015. Springer.
Walter, M., Lee, J., Kaibel, V. and Weltge, S.
Extended Formulations for Independence Polytopes of Regular Matroids. Graphs and Combinatorics, 32(5):1931—1944, December 2015.
Tillmann, A., Eldar, Y. C. and Mairal, J.
Dictionary Learning from Phaseless Measurements. 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pages 4702—4706, December 2015.
Tillmann, A., Eldar, Y. C. and Mairal, J.
DOLPHIn - Dictionary Learning for Phase Retrieval. IEEE Transactions on Signal Processing, 64(24):6485—6500, December 2015.
Lübbecke, M., Koster, A.M.C.A., Letmathe, P., Madlener, R., Peis, B. and Walther, G.
Operations Research Proceedings 2014. Springer, December 2015.
Gauthier, J.-B., Desrosiers, J. and Lübbecke, M.
About the minimum mean cycle-canceling algorithm. Discrete Applied Mathematics, 196:115—134, November 2015.
Tillmann, A.
Equivalence of Linear Programming and Basis Pursuit. Proc. in Applied Mathematics and Mechanics (PAMM) 15(1), pages 735—738, October 2015.
Coughlan, E.T., Lübbecke, M. and Schulz, J.
A branch-price-and-cut algorithm for multi-mode resource leveling. European Journal of Operational Research, 245(1):70—80, September 2015.
Lübbecke, M.
Comments on: An overview of curriculum-based course timetabling. TOP, 23(2):359—361, June 2015.
Lübbecke, M. and Witt, J.T.
Separation of Generic Cutting Planes in Branch-and-Price Using a Basis. In Bampis, E., Experimental Algorithms - SEA 2015, pages 110—121, May 2015. Springer. Lecture Notes in Computer Science, vol 9125.
2014
Bergner, M., Caprara, A., Ceselli, A., Furini, F., Lübbecke, M., Malaguti, E. and Traversi, E.
Automatic Dantzig–Wolfe reformulation of mixed integer programs. Mathematical Programming, 149(1—2):391—424, December 2014.
Conforti, M., Kaibel, V., Walter, M. and Weltge, S.
Subgraph polytopes and independence polytopes of count matroids. Operations Research Letters, 43(5):457—460, December 2014.
Kaibel, V. and Walter, M.
Simple extensions of polytopes. Mathematical Programming, Series B, 154(1—2):381—406, December 2014.
Lorenz, D.A., Pfetsch, M.E. and Tillmann, A.
Solving Basis Pursuit: Heuristic Optimality Check and Solver Comparison. ACM Transactions on Mathematical Software, 41(2):Art. No. 8, December 2014.
Tillmann, A.
On the Computational Intractability of Exact and Approximate Dictionary Learning. IEEE Signal Processing Letters, 22(1):45—49, December 2014.
Gauthier, J.-B., Desrosiers, J. and Lübbecke, M.
Decomposition theorems for linear programs. Operations Research Letters, 42(8):553—557, November 2014.
Goderbauer, S.
Optimierte Einteilung der Wahlkreise für die Deutsche Bundestagswahl. OR News, November 2014.
Desrosiers, J., Gauthier, J.-B. and Lübbecke, M.
Row-reduced column generation for degenerate master problems. European Journal of Operational Research, 236(2):453—460, July 2014.
Bergner, M., Lübbecke, M. and Witt, J.T.
A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs. In Gudmundsson, J. and Katajainen, J., Experimental Algorithms - SEA 2014, pages 34—45, May 2014. Springer. Lecture Notes in Computer Science, vol 8504.
Lübbecke, M., Weiler, A. and Werners, B.
Zukunftsperspektiven des Operations Research. Springer Gabler, May 2014.
Tillmann, A., Gribonval, R. and Pfetsch, M.E.
Projection Onto The Cosparse Set is NP-Hard. 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pages 7148—7152, April 2014.
Kirchner, S. and Lübbecke, M.
Dynamische Vergabe von Patiententerminen in Krankenhäusern. In Lübbecke, M., Weiler, A. and Werners, B., Zukunftsperspektiven des Operations Research: Erfolgreicher Einsatz und Potenziale, pages 83—96, April 2014. Springer.
Sørensen, M. and Dahms, F.H.W.
A Two-Stage Decomposition of High School Timetabling applied to cases in Denmark. Computers & Operations Research, 43:36—49, February 2014.
2013
Büsing, C. and D'Andreagiovanni, F.
A New Theoretical Framework for Robust Optimization Under Multi-Band Uncertainty. In Helber, S., Breitner, M., Rösch, D., Schön, C., Graf von der Schulenburg, J., Sibbertsen, P., Steinbach, M., Weber, S. and Wolter, A., Operations Research Proceedings 2012: Selected Papers of the International Annual Conference of the German Operations Research Society (GOR), pages 115—121, Hannover, December 2013. Leibniz University, Springer.
Kaibel, V. and Walter, M.
Simple Extensions of Polytopes. In Lee, J. and Vygen, J., Integer Programming and Combinatorial Optimization (IPCO), pages 309—320, December 2013. Springer. Lecture Notes in Computer Science, vol 8494.
Tillmann, A. and Pfetsch, M.E.
The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing. IEEE Transactions on Information Theory, 60(2):1248—1259, December 2013.
Lorenz, D.A., Pfetsch, M.E. and Tillmann, A.
An infeasible-point subgradient method using adaptive approximate projections. Computational Optimization and Applications, 57(2):271—306, December 2013.
Tillmann, A.
Computational Aspects of Compressed Sensing. Doctoral Dissertation, TU Darmstadt, December 2013. ISBN 978-3-8439-1445-1.
2012
Steglich, U., Büsing, C. and Kutschka, M.
A Generic Multi-layer Network Optimization Model with Demand Uncertainty. In Bauschert, T., Advances in Communication Networking, pages 13—24, Chemnitz, Deutschland, December 2012. Springer.
Büsing, C.
Robust optimization under multiband uncertainty. CTW, pages 35—38, December 2012. CTIT Workshop Proceedings.
Walter, M. and Truemper, K.
Implementation of a unimodularity test. Mathematical Programming Computation, 5(1):57—73, December 2012.
Büsing, C. and D'Andreagiovanni, F.
New Results about Multi-band Uncertainty in Robust Optimization. In Klasing, R., Experimental Algorithms (SEA), pages 63—74, June 2012. Springer. Lecture Notes in Computer Science, vol 7276.
Lübbecke, M.
Automatic Decomposition and Branch-and-Price---A Status Report. Experimental Algorithms (SEA), pages 1—8, June 2012. Springer. Lecture Notes in Computer Science, vol 7276.
Hennig, F., Nygreen, B. and Lübbecke, M.
Nested column generation applied to the crude oil tanker routing and scheduling problem with split pickup and split delivery. Naval Research Logistics, 59(3—4):298—310, April 2012.
Lach, G. and Lübbecke, M.
Curriculum based course timetabling: new solutions to Udine benchmark instances. Annals of Operations Research, 194(1):255—272, March 2012.
2011
Büsing, C.
Kreuz und quer durchs Land der Graphen - Projekte aus der Graphentheorie für Schülerinnen und Schüler. Der Mathematikunterricht, 58:52—63, December 2011.
Büsing, C.
Recoverable robust shortest path problems. Networks, 59:181—189, December 2011.
Walter, M.
Sparsity of Lift-and-Project Cutting Planes. In Helber, S., Breitner, M., Rösch, D., Graf von der Schulenburg, J., Schön, C., Sibbertsen, P., Steinbach, M., Weber, S. and Wolter, A., Operations Research Proceedings 2012. pages 9—14, Springer International Publishing, Hannover, December 2011.
Wenger, S., Ament, M., Guthe, S., Lorenz, D.A., Tillmann, A., Weiskopf, D. and Magnor, M.
Visualization of Astronomical Nebulae via Distributed Multi-GPU Compressed Sensing Tomography. IEEE Transactions on Visualization and Computer Graphics, 18(12):2188—2197, December 2011.
Büsing, C., Koster, A.M.C.A. and Kutschka, M.
Recoverable Robust Knapsacks: Gamma-Scenarios. In Pahl, J., Reiners, T. and Voß, S., Network Optimization (INOC), pages 583—588, June 2011. Springer. Lecture Notes in Computer Science, vol 6701.
Bergner, M., Caprara, A., Furini, F., Lübbecke, M., Malaguti, E. and Traversi, E.
Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation. In Günlük, O. and Woeginger, G.J., Integer Programming and Combinatoral Optimization (IPCO), pages 39—51, June 2011. Springer. Lecture Notes in Computer Science, vol 6655.
Höhn, W., König, F.G., Möhring, R. and Lübbecke, M.
Integrated Sequencing and Scheduling in Coil Coating. Management Science, 57(4):647—666, March 2011.
Büsing, C., Koster, A.M.C.A. and Kutschka, M.
Recoverable robust knapsacks: the discrete scenario case. Optimization Letters, 5(3):379—392, March 2011.
Desrosiers, J. and Lübbecke, M.
Branch-Price-and-Cut Algorithms. In Cochran, J.J., Encyclopedia of Operations Research and Management Science. John Wiley & Sons, January 2011.
Lübbecke, M.
Column Generation. In Lübbecke, M., Wiley Encyclopedia of Operations Research and Management Science. John Wiley & Sons, Chichester, January 2011.
2010
Büsing, C. and Stiller, S.
Line planning, path constrained network flow and inapproximability. Networks, 57(1):106–113, December 2010.
Erlebach, T. and Lübbecke, M.
Proceedings of the 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10). OpenAccess Series in Informatics (OASIcs), September 2010. Schloss Dagstuhl-Leibniz-Zentrum für Informatik.
Erlebach, T. and Lübbecke, M.
Preface. In Erlebach, T. and Lübbecke, M., Proceedings of the 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, pages i—ix, September 2010. Schloss Dagstuhl-Leibniz-Zentrum für Informatik.
Büsing, C. and Maue, J.
Robust Algorithms for Sorting Railway Cars. In de Berg, M. and Meyer, U., Algorithms – ESA 2010. ESA 2010. Lecture Notes in Computer Science, pages 350—361, September 2010. Springer.
Berthold, T., Heinz, S., Lübbecke, M., Möhring, R. and Schulz, J.
A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling. In Lodi, A., Milano, M. and Toth, P., Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, pages 313—317, June 2010. Springer. Lecture Notes in Computer Science, vol 6140.
Coughlan, E.T., Lübbecke, M. and Schulz, J.
A Branch-and-Price Algorithm for Multi-mode Resource Leveling. In Festa, P., Experimental Algorithms (SEA), pages 226—238, May 2010. Springer. Lecture Notes in Computer Science, vol 6049.
Gamrath, G. and Lübbecke, M.
Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs. In Festa, P., Experimental Algorithms (SEA), pages 239—252, May 2010. Springer. Lecture Notes in Computer Science, vol 6049.
2008
Liebchen, C., Lübbecke, M., Möhring, R. and Stiller, S.
The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications. In Ahuja, R.K., Möhring, R. and Zaroliagis, C., Robust and Online Large-Scale Optimization. pages 1—27, Springer, December 2008. Lecture Notes in Computer Science, vol 5868.
Büsing, C.
The Exact Subgraph Recoverable Robust Shortest Path Problem. In Ahuja, R.K., Möhring, R. and Zaroliagis, C., Robust and Online Large-Scale Optimization, pages 231—248, December 2008. Springer. Lecture Notes in Computer Science, vol 5868.
König, F.G. and Lübbecke, M.
Sorting with Complete Networks of Stacks. In Hong, S., Nagamochi, H. and Fukunaga, T., Algorithms and Computation (ISAAC), pages 895—906, December 2008. Springer. Lecture Notes in Computer Science, vol 5369.
Ceselli, A., Gatto, M., Lübbecke, M., Nunkesser, M. and Schilling, H.
Optimizing the Cargo Express Service of Swiss Federal Railways. Transportation Science, 42(4):450 — 465, October 2008.
Fekete, S., Lübbecke, M. and Meijer, H.
Minimizing the Stabbing Number of Matchings, Trees, and Triangulations. Discrete & Computational Geometry, 40:595—621, October 2008.
Di Stefano, G., Krause, S., Lübbecke, M. and Zimmermann, U.
On minimum k-modal partitions of permutations. Journal of Discrete Algorithms, 6(3):381—392, July 2008.
Lach, G. and Lübbecke, M.
Optimal University Course Timetables and the Partial Transversal Polytope. In McGeoch, C., Experimental Algorithms (WEA), pages 235—248, May 2008. Springer. Lecture Notes in Computer Science, vol 5038.
2007
Felsner, S., Lübbecke, M. and Nešetřil, J.
Preface. Discrete Mathematics, 308(8):1347—1349, November 2007.
Felsner, S., Lübbecke, M. and Nešetřil, J.
Editorial. European Journal of Combinatorics, 28(8):2053—2056, October 2007.
König, F.G., Lübbecke, M., Möhring, R., Schäfer, G. and Spenke, I.
Solutions to Real-World Instances of PSPACE-Complete Stackin. In Arge, L., Hoffmann, M. and Welzl, E., Algorithms (ESA), pages 729—740, October 2007. Springer. Lecture Notes in Computer Science, vol 4698.
Heinrich-Litan, L. and Lübbecke, M.
Rectangle covers revisited computationally. Journal of Experimental Algorithmics, 11:Article 2.6, February 2007.
2006
Di Stefano, G., Krause, S., Lübbecke, M. and Zimmermann, U.
On minimum k-modal partitions of permutations. In Correa, J., Hevia, A. and Kiwi, M., Theoretical Informatics (LATIN), pages 374—385, March 2006. Springer. Lecture Notes in Computer Science, vol 3887.
2005
Desrosiers, J. and Lübbecke, M.
Selected Topics in Column Generation. Operations Research, 53(6):1007—1023, November 2005.
Villeneuve, D., Desrosiers, J., Lübbecke, M. and Soumis, F.
Compact Formulations for Integer Programs Solved by Column Generation. Annals of Operations Research, 139(1):375–388, September 2005.
Lübbecke, M. and Zimmermann, U.
Shunting Minimal Rail Car Allocation. Computational Optimization and Applications, 31(3):295–308, June 2005.
Heinrich-Litan, L. and Lübbecke, M.
Rectangle Covers Revisited Computationally. In Nikoletseas, S., Experimental and Efficient Algorithms (WEA), pages 55—66, May 2005. Springer. Lecture Notes in Computer Science, vol 3503.
Lübbecke, M.
Dual variable based fathoming in dynamic programs for column generation. European Journal of Operational Research, 162(1):122—125, March 2005.
2004
Desrosiers, J. and Lübbecke, M.
A Primer in Column Generation. In Desaulniers, G., Desrosiers, J. and Solomon, M.M., Column Generation. chapter 1, pages 1—32, Springer US, December 2004.
Lübbecke, M.
Combinatorially Simple Pickup and Delivery Paths. Central European Journal of Operations Research, 12(4):405—417, September 2004.
Bussieck, M.R., Lindner, T. and Lübbecke, M.
A fast algorithm for near cost optimal line plans. Mathematical Methods of Operations Research, 59(2):205–220, May 2004.
Fekete, S., Lübbecke, M. and Meijer, H.
Minimizing the stabbing number of matchings, trees, and triangulations. In Munro, I., SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, pages 437—446, January 2004. Society for Industrial and Applied Mathematics.
2003
Lübbecke, M. and Zimmermann, U.
Engine Routing and Scheduling at Industrial In-Plant Railroads. Transportation Science, 37(2):183—197, February 2003.
2002
Epping, T., Hochstättler, W. and Lübbecke, M.
MaxFlow-MinCut Duality for a Paint Shop Problem. In Leopold-Wildburger, U., Rendl, F. and Wäscher, G., Operations Research Proceedings 2002, pages 377—382, December 2002. Springer.
Zimmermann, U. and Lübbecke, M.
Computer Aided Scheduling of Switching Engines. In Jäger, W. and Krebs, H., Mathematics — Key Technology for the Future. pages 690—702, Springer, December 2002.
2001
Werners, B. and Lübbecke, M.
Tagungsbericht OR 2001 Gerhard-Mercator-Universität Duisburg. OR News, 13:35—37, October 2001.
1999
Lübbecke, M. and Zimmermann, U.
Optimale Disposition von Rangierlokomotiven bei Werks- und Industriebahnen - Vom Bedarf zum Produkt. Arbeitskreis Mathematik in Forschung und Praxis, pages 35—40, December 1999. Symposium Modellierung und Simulation von Verkehr.
1998
Bernatzki, K.-P., Bussieck, M.R., Lindner, T. and Lübbecke, M.
Optimal scrap combination for steel production. OR Spectrum, 20(4):251—258, October 1998.
Bussieck, M.R. and Lübbecke, M.
The vertex set of a 0/1-polytope is strongly P-enumerable. Computational Geometry, 11(2):103—109, September 1998.
Bussieck, M.R., Lübbecke, M., Winter, T. and Zimmermann, U.
Discrete optimization in rail transport. Proceedings of 11th Baikal International School-Seminar on Optimization Methods and their Applications, pages 225—234, May 1998.