Two clicks for more data protection: Only if you click here, the button will be active and you can send your recommendation to Facebook. Yet at activating data is transmitted to third parties.Two clicks for more data protection: Only if you click here, the button will be active and you can send your recommendation to Twitter. Yet at activating data is transmitted to third parties.Two clicks for more data protection: Only if you click here, the button will be active and you can send your recommendation to Google. Yet at activating data is transmitted to third parties.Two clicks for more data protection: Only if you click here, the button will be active and you can send your recommendation to Xing. Yet at activating data is transmitted to third parties.

For timely dissemination of unpublished works, we have a preprint series, the repORts.

Publications


2014

  • C. Büsing and F. D'Andreagiovanni (2014).
    A New Theoretical Framework for Robust Optimization Under Multi-Band Uncertainty. In Helber, St., Breitner, M., Rösch, D. and Schön, C. (Eds.) Operations Research Proceedings 2012. Springer, Berlin, pp. 115-121. [doi] [bib]
  • J. Desrosiers, J.B. Gauthier and M.E. Lübbecke (2014).
    Row-reduced Column Generation for Degenerate Master Problems. European J. Oper. Res. 236 (2): 453-460. [pdf] [doi] [bib]
  • (2014).
    Zukunftsperspektiven des Operations Research: Erfolgreicher Einsatz und Potenziale. In M. Lübbecke, A. Weiler and B. Werners (Eds.) Springer Gabler, [doi] [www] [bib]
  • S. Kirchner and M. Lübbecke (2014).
    Dynamische Vergabe von Patiententerminen in Krankenhäusern. In M. Lübbecke, A. Weiler and B. Werners (Eds.) Zukunftsperspektiven des Operations Research: Erfolgreicher Einsatz und Potenziale. Springer Gabler, [doi] [www] [bib]
  • J.B. Gauthier, J. Desrosiers and M.E. Lübbecke (2014).
    Decomposition theorems for linear programs. Oper. Res. Lett. 42 (8): 553-557. [pdf] [doi] [bib]
  • A.M. Tillmann and M.E. Pfetsch (2014).
    The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing. IEEE Transactions on Information Theory 60 (2) (2014-): 1248-1259. [doi] [bib] [ArXiv]
  • D.A. Lorenz, M.E. Pfetsch and A.M. Tillmann (2014).
    An Infeasible-Point Subgradient Method Using Adaptive Approximate Projections. Computational Optimization and Applications 57 (2) (2014-): 271-306. [doi] [bib] [ArXiv]
  • A.M. Tillmann, R. Gribonval and M.E. Pfetsch (2014).
    Projection Onto The Cosparse Set is NP-Hard. Proc. ICASSP 2014. pp. 7148-7152. [doi] [bib] [ArXiv]

2013

  • C. Büsing, F. D'Andreagiovanni and A. Raymond (2013).
    Robust optimization under multiband uncertainty. In Cornelissen, K., Hoeksma, R., Hurink, J. and Manthey, B. (Eds.) CTW. CTIT Workshop Proceedings WP 13-01: pp. 35-38. [bib]
  • U. Steglich, T. Bauschert, C. Büsing and M. Kutschka (2013).
    A Generic Multi-layer Network Optimization Model with Demand Uncertainty. U. Steglich, T. Bauschert, C. Büsing and M. Kutschka Advances in Communication Networking - 19th EUNICE/IFIP WG 6.6 International Workshop. Springer Berlin Heidelberg, Lect. Notes Comput. Sci. 8115: pp. 13-24. [doi] [bib]
  • M. Walter and K. Truemper (2013).
    Implementation of a unimodularity test. Math. Program. Ser. C 5 (2013-): 57-73. [bib]
  • A.M. Tillmann (2013).
    Computational Aspects of Compressed Sensing. Doctoral Dissertation, TU Darmstadt [www] [bib]

2012

  • F. Hennig, B. Nygreen and M.E. Lübbecke (2012).
    Nested column generation applied to the crude oil tanker routing and scheduling problem with split pickup and split delivery. Naval Res. Logist. 59 (2012-): 298-310. [pdf] [doi] [bib]
  • G. Lach and M.E. Lübbecke (2012).
    Curriculum based course timetabling: New solutions to Udine benchmark instances. Ann. Oper. Res. 194 (1): 255-272. [pdf] [doi] [bib]
  • M.E. Lübbecke (2012).
    Automatic Decomposition and Branch-and-Price–A Status Report. M.E. Lübbecke Experimental Algorithms. Springer, Berlin Lect. Notes Comput. Sci. 7276: pp. 1-8. [pdf] [doi] [bib]
  • C. Büsing (2012).
    Recoverable robust shortest path problems. Networks 59: 181-189. [doi] [bib]
  • C. Büsing and F. D'Andreagiovanni (2012).
    New results about multi-band uncertainty in Robust Optimization. C. Büsing and F. D'Andreagiovanni Experimental Algorithms - SEA 2012. Springer Berlin Heidelberg, Lect. Notes Comput. Sci. 7276: pp. 63-74. [doi] [bib]
  • C. Büsing and G. Hoever (2012).
    Kreuz und quer durchs Land der Graphen - Projekte aus der Graphentheorie für Schülerinnen und Schüler. Der Mathematikunterricht 58: 52-63. [bib]
  • M.E. Lübbecke and Chr. Puchert (2012).
    Primal Heuristics for Branch-and-Price Algorithms. In D. Klatte, H.-J. Lüthi and K. Schmedders (Eds.) Operations Research Proceedings 2011. Springer, Berlin pp. 65-70. [doi] [bib]
  • M. Walter (2012).
    Sparsity of Lift-and-Project Cutting Planes. In Helber, S., Breitner, M., Rösch, D., Schön, C., Graf von der Schulenburg, J.-M., Sibbertsen, P., Steinbach, M., Weber, S. and Wolter, A. (Eds.) Operations Research Proceedings 2012. Springer International Publishing, [doi] [www] [bib]
  • S. Wenger, M. Ament, S. Guthe, D. Lorenz, A.M. Tillmann, D. Weiskopf and M. Magnor (2012).
    Visualization of Astronomical Nebulae via Distributed Multi-GPU Compressed Sensing Tomography. IEEE Transactions on Visualization and Computer Graphics 18 (12) (2012-): 2188-2197. [doi] [bib]

2011

  • M. Bergner, A. Caprara, F. Furini, M.E. Lübbecke, E. Malaguti and E. Traversi (2011).
    Partial convexification of general MIPs by Dantzig-Wolfe reformulation. In O. Günlük and G.J. Woeginger (Eds.) Integer Programming and Combinatorial Optimization. Springer, Berlin Lect. Notes Comput. Sci. 6655: pp. 39-51. [doi] [bib]
  • W. Höhn, F.G. König, M.E. Lübbecke and R.H. Möhring (2011).
    Integrated Sequencing and Scheduling in Coil Coating. Management Sci. 57 (4): 647-666. [pdf] [doi] [bib]
  • M.E. Lübbecke (2011).
    Column Generation. M.E. Lübbecke Encyclopedia of Operations Research and Management Science. John Wiley & Sons, Chichester [pdf] [doi] [bib]
  • J. Desrosiers and M.E. Lübbecke (2011).
    Branch-Price-and-Cut Algorithms. J. Desrosiers and M.E. Lübbecke Encyclopedia of Operations Research and Management Science. John Wiley & Sons, Chichester [pdf] [doi] [bib]
  • C. Büsing (2011).
    Recoverable Robustness in Combinatorial Optimization. Cuvillier Verlag, [bib]
  • C. Büsing, A. M. C. A. Koster and M. Kutschka (2011).
    Recoverable Robust Knapsacks: The Discrete Scenario Case. Optimization Letters 5: 379-392. [doi] [bib]
  • C. Büsing, A. M. C. A. Koster and M. Kutschka (2011).
    Recoverable Robust Knapsacks: Gamma-Scenarios. International Network Optimization Conference, INOC 2011. 6701: pp. 583-588. [doi] [bib]
  • C. Büsing and S. Stiller (2011).
    Line planning, path constrained network flow and inapproximability. Networks 57: 106-113. [doi] [bib]
  • M. Walter (2011).
    Sparsity of Lift-and-Project Cutting Planes. [www] [bib]

Displaying results 31 to 60 out of 101

< Previous

Page 1

Page 2

Page 3

Page 4

Next >

Copyright Notice: The documents distributed here have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.