Home › Publications

Publications

  1. Jünger, M., Jünger, P., Mutzel, P., Reinelt, G.
    PACE Solver Description: Exact Solution of the One-Sided Crossing Minimization Problem by the MPPEG Team
    In: Bonnet, E., Rzazewski, P. (eds): 19th Int. Symposium on Parameterized and Exact Computation (IPEC 2024),
    Leibniz International Proceedings in Informatics (LIPIcs), Volume 321, pp. 27:1-27:4 (2024)
    -->Link  cit. (Scholar): 2

  2. Grötschel, M. Jünger, M., Reinelt, G.
    Comments on "An Exact Method for the Minimum Feedback Arc Set Problem"
    ACM Journal of Experimental Algorithmics 27, 1-4 (2022)
    -->Link   -->PDF  cit. (Scholar): 5

  3. Martí, R., Reinelt, G.
    Exact and Heuristic Methods in Combinatorial Optimization: A Study on the Linear Ordering and the Maximum Diversity Problem
    Springer (2022)
    -->Link  cit. (Scholar): 80

  4. Jünger, M., Lobe, E., Mutzel, P., Reinelt, G., Rendl. F., Rinaldi, G., Stollenwerk, T.
    Quantum Annealing versus Digital Computing: An Experimental Comparison
    ACM Journal of Experimental Algorithmics (JEA) 26, 1-30 (2021)
    -->Link   -->HTML  cit. (Scholar): 56

  5. Chen, X., Reinelt, G., Guangming, D., Spitz, A.
    A Mixed Integer Linear Programming Model for Multi-Satellite Scheduling
    European Journal of Operational Research 275(2), 694-707 (2019)
    -->Link   -->PDF  cit. (Scholar): 193

  6. Jünger, M., Lobe, E., Mutzel, P., Reinelt, G., Rendl. F., Rinaldi, G., Stollenwerk, T.
    Performance of a quantum annealer for ising ground state computations on chimera graphs
    arXiv:1904.11965 (2019)
    -->Link  cit. (Scholar): 29

  7. Chen, X., Reinelt, G., Guangming, D., Wang, M.
    Priority-Based and Conflict-Avoidance Heuristics for Multi-Satellite Scheduling
    Applied Soft Computing 69(3), 177-181 (2018)
    -->Link  cit. (Scholar): 85

  8. Shen, R., Reinelt, G., Canu, S.
    A First Derivative Potts Model for Segmentation and Denoising Using ILP
    In: Kliewer, N., Ehmke, J., Borndörfer, R. (eds.) Operations Research Proceedings 2017, Springer, Cham, 53-59 (2018)
    -->Link  cit. (Scholar): 4

  9. Shen, R., Chen, X., Zheng, X., Reinelt, G.
    Discrete Potts Model for Generating Superpixels on Noisy Images
    arXiv:1803.07351 (2018)
    -->Link  cit. (Scholar): 5

  10. Chen, X., Dai, G. and Reinelt, G. and Wang, M.
    A Semi-Analytical Method for Periodic Earth Coverage Satellites Optimization
    IEEE Communications Letters 22(3), 534-537 (2018)
    -->Link  cit. (Scholar): 14

  11. Dai, G., Chen, X., Wang, M., Nguyen, T.N., Fernandez, E., Reinelt, G.
    On the Analysis of Satellite Constellations for the Continuous Coverage of Ground Regions
    Journal of Spacecraft and Rockets 54(6), 1294-1303 (2017)
    -->Link   -->PDF  cit. (Scholar): 69

  12. Nguyen, T. N., ,Reinelt, G.
    On travel time functions for mixed traffic systems dominated by motorcycles
    In: Bock, H., Phu, H., Rannacher, R., Schlöder, J. (eds): Modeling, Simulation and Optimization of Complex Processes HPSC 2015,
    Springer, Cham, 139--150 (2017)
    -->Link  cit. (Scholar): -

  13. Silvestri, F., Reinelt, G.
    The LP-Newton Method and Conic Optimization
    arXiv:1611.09260 (2017)
    -->Link  cit. (Scholar): 2

  14. Kappes, J. H., Speth, M., Reinelt, G., Schnörr, C.
    Higher-order Segmentation via Multicuts
    Computer Vision and Image Understanding 143, 104-119 (2016)
    -->Link   -->PDF  cit. (Scholar): 67

  15. Silvestri, F., Reinelt, G., Schnörr, C.
    A Convex Relaxation Approach to the Affine Subspace Clustering Problem
    In: J. Gall, P. Gehler, B. Leibe (eds.): Pattern Recognition: Proceedings of the 37th German Conference, GCPR 2015, Aachen, October 7-10,
    2015. Lecture Notes in Computer Science, vol. 9358, pp. 67-78. Springer, Heidelberg (2015)
    -->Link   -->PDF  cit. (Scholar): 4

  16. Lörwald, S., Reinelt, G.
    PANDA: a software for polyhedral transformations
    EURO Journal on Computational Optimization 3(4), 297-308 (2015)
    -->Link  cit. (Scholar): 57

  17. Ahr, D., Reinelt, G.
    The Capacitated Arc Routing Problem: Combinatorial Lower Bounds
    In: Corberán, A., Laport. G. (eds.): Arc Routing: Problems, Methods, and Applications, MOS-SIAM Series on Optimization, pp. 159-181 (2015)
    -->Link  cit. (Scholar): 9

  18. Wiesberg, S., Reinelt, G.
    Evaluating the quality of image matrices in blockmodeling
    EURO Journal on Computational Optimization 3(2), 111-129 (2015)
    -->Link  cit. (Scholar): -

  19. Michael N. Jung, M.N., Reinelt, G., Sager, S.
    The Lagrangian relaxation for the combinatorial integral approximation problem
    Optimization Methods & Software, Volume 30(1), 54-80 (2015)
    -->Link  cit. (Scholar): 46

  20. Wiesberg, S., Reinelt, G.
    Relaxations in Practical Clustering and Blockmodeling
    Informatica 39(3), 249-256 (2015)
    -->Link   -->PDF  cit. (Scholar): 2

  21. Hildenbrandt, A., Reinelt, G.
    Integer Programming Models for the Target Visitation Problem
    Informatica 39(3), 257-260 (2015)
    -->Link   -->PDF  cit. (Scholar): 10

  22. Békési, J., Galambos G., Jung, M., Oswald, M., Reinelt, G.
    A branch-and-bound algorithm for the coupled task problem
    Mathematical Methods of Operations Research 80(1), 47-82 (2014)
    -->Link  cit. (Scholar): 14

  23. Bonato, T., Jünger, M., Reinelt, G., Rinaldi, G.
    Lifting and separation procedures for the cut polytope
    Mathematical Programming, Series A 146(1-2), 351-378 (2014)
    -->Link  cit. (Scholar): 36

  24. Zenthöfer, A., Wiesberg, S., Hildenbrandt, A., Reinelt, G., Rammelsberg, P., Hassel, A.J.
    Selecting VITA Classical Shades by use of the VITA 3D Master Shade Guide
    The International Journal of Prosthodontics 27(4), 376-382 (2014)
    -->Link  cit. (Scholar): 52

  25. Piro, R., Wiesberg, S., Schramm, G., Rebel, N., Oswald, M., Eils, R., Reinelt, G., König, R.
    Network topology-based detection of differential gene regulation and regulatory switches in cell metabolism and signaling pathways
    BMC Systems Biology 8(56), 10 p. (2014)
    -->Link  cit. (Scholar): 5

  26. Reinelt, G., Seitz, H.
    On a Binary Distance Model for the Minimum Linear Arrangement Problem
    Top 22(1) , 384-396 (2014)
    -->Link  cit. (Scholar): 4

  27. Balogh, J., Békési, J., Galambos G., Reinelt, G.
    On-line bin packing with restricted repacking
    Journal of Combinatorial Optimization 27, 115-131 (2014).
    -->Link  cit. (Scholar): 31

  28. Fernández, E., Luna-Mota, C., Hildenbrandt, A., Reinelt, G., Wiesberg, S.
    A Flow Formulation for the Optimum Communication Spanning Tree
    Electronic Notes in Discrete Mathematics 41, 85-92 (2013).
    -->Link   -->PDF  cit. (Scholar): 12

  29. Hildenbrandt, A., Reinelt, G., Heismann, O.
    Integer programming models for the target visitation problem
    In: Gams, M. et. al., eds.: Proceedings of the 16th International Multiconference:
    INFORMATION SOCIETY - IS 2013, Volume A, 569--572 (2013)
    -->Link   -->PDF  cit. (Scholar): -

  30. Jünger, M., Reinelt, G. (eds.)
    Martin Grötschel - The Early Years in Bonn and Augsburg
    In: Jünger, M., Reinelt, G. (eds.) Facets of Combinatorial Optimization, pp. 5-19, Springer, Berlin, Heidelberg (2013)
    -->Link  cit. (Scholar): -

  31. Jünger, M., Reinelt, G. (eds.)
    Facets of Combinatorial Optimization, Festschrift for Martin Grötschel
    Springer (2013)
    -->Link  cit. (Scholar): -

  32. Hassel, A., Zenthöfer, A., Corcodel, N., Hildenbrandt, A., Reinelt, G., Wiesberg, S.
    Determination of VITA Classical Shades with 3D Master Shade Guide
    Acta Odontologica Scandinavica 71(3-4), 721-726 (2013)
    -->Link  cit. (Scholar): 38

  33. Kappes, J. H., Speth, M., Reinelt, G., Schnörr, C.
    Towards Efficient and Exact MAP-Inference for Large Scale Discrete Computer Vision Problems via Combinatorial Optimization
    In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR), Portland, USA,
    June 23-28, 2013, 1752-1758. Los Alamitos, CPS (2013)
    -->Link   -->PDF  cit. (Scholar): 52

  34. Contreras, I., Fernandez, E., Reinelt, G.
    Minimizing the maximum travel time in a combined model of facility location and network design
    Omega 40(6), 847-860 (2012)
    -->Link  cit. (Scholar): 107

  35. Oswald, M., Reinelt, G., Wiesberg, S.
    Exact Solution of the 2-Dimensional Grid Arrangement Problem
    Discrete Optimization 9(3), 189-199 (2012)
    doi.org/10.1016/j.disopt.2012.07.002
    -->Link  cit. (Scholar): 10

  36. Cocking, C., Fleßa, S., Reinelt, G.
    Improving access to health facilities in Nouna District, Burkina Faso
    Socio-Economic Planning Sciences 46(2), 164-172 (2012)
    -->Link  cit. (Scholar): 40

  37. Zeller, W., Mayle, M., Bonato, T., Reinelt, G., Schmelcher P.
    Spectra and ground states of one- and two-dimensional laser-driven lattices of ultracold Rydberg atoms
    Physical Review A 85(6), 14 p. (2012)
    -->Link  cit. (Scholar): 17

  38. Corberán, A., Oswald, M., Plana, I., Reinelt, G., Sanchis, J.M.
    New results on the Windy Postman Problem
    Mathematical Programming A 132(1-2), 309-332 (2012)
    -->Link  cit. (Scholar): 25

  39. Martí, R., Reinelt, G., Duarte, A.
    A Benchmark Library and a Comparison of Heuristic Methods for the Linear Ordering Problem
    Computational Optimization and Applications 51(3), 1297-1317 (2012)
    -->Link   -->PDF  cit. (Scholar): 90

  40. Rebennack, S., Reinelt, G., Pardalos, P.M.
    A tutorial on branch and cut algorithms for the maximum stable set problem
    International Transactions in Operational Research 19(1-2), 161-199 (2012)
    -->Link  cit. (Scholar): 54

  41. Caprara, A., Oswald, M., Reinelt, G., Schwarz, R. Traversi, E.
    Optimal linear arrangements using betweenness variables
    Mathematical Programming Computation 3(3), 261-280 (2011)
    -->Link  cit. (Scholar): 30

  42. Wang, P., Reinelt, G., Gao, P., Tan Y.
    A model, a heuristic and a decision support system to solve the scheduling problem of an earth observing satellite constellation
    Computers and Industrial Engineering 61(2), 322-335 (2011)
    -->Link  cit. (Scholar): 275

  43. Kappes, J.H., Speth, M., Andres, B., Reinelt, G., Schnörr, C.
    Globally Optimal Image Partitioning by Multicuts
    In: Y. Boykov, F. Kahl, V., Lempitsky, F.R., Schmidt (eds.): Proceedings of the 8th Int. Conf. on Energy Minimization Methods in
    Computer Vision and Pattern Recognition (EMMCVPR), St. Petersburg, Russia, July 25-27, 2011,
    Lecture Notes in Computer Science, vol. 6819, pp. 31-44. Springer, Heidelberg (2011)
    -->Link  cit. (Scholar): 107

  44. Wang, P., Reinelt, G.
    Solving the Earth Observing Satellite Constellation Scheduling Problem by Branch-and-Price
    In: B. Hu, K. Morasch, S. Pickl, M. Siegle (eds.): Operations Research Proceedings 2010 - Selected papers of the
    Annual International Conference of the German Operations Research Society, München, September 1-3 2010,
    pp. 491-496. Springer, Heidelberg (2011)
    -->Link  cit. (Scholar): 11

  45. Békési J., Galambos, G., Jung, M., Oswald M., Reinelt, G.
    Exact Algorithms for the General Coupled Task Scheduling Problem
    In: Gams, M. et. al., eds.: Proceedings of the 16th International Multiconference:
    INFORMATION SOCIETY - IS 2013, Volume A, 577-578 (2013)
    -->Link   -->PDF  cit. (Scholar): -

  46. Wiesberg, S., Reinelt G.
    Relaxations in Practical Clustering and Blockmodeling
    In: Gams, M. et. al., eds.: Proceedings of the 16th International Multiconference:
    INFORMATION SOCIETY - IS 2013, Volume A, 607-610 (2013)
    -->Link   -->PDF  cit. (Scholar): -

  47. Rebennack, S., Oswald, M., Theis, D.O., Seitz, H., Reinelt, G., Pardalos, P.M.
    A Branch and Cut solver for the maximum stable set problem
    Journal of Combinatorial Optimization 21(4), 434-457 (2011)
    -->Link  cit. (Scholar): 75

  48. Martí, R., Reinelt, G.
    The Linear Ordering Problem - Exact and Heuristic Methods in Combinatorial Optimization
    Aplied Mathematical Sciences 175, Springer, Heidelberg (2011)
    -->Link  cit. (Scholar): 407

  49. Balogh, J., Békési, J., Galambos, G., Reinelt, G.
    On a multidimensional semi-online bin packing problem
    In: A. Egri-Nagy, E. Kovács, G. Kovásznai, G. Kusper, T. Támács (eds.) Proceedings of the 8th International
    Conference on Applied Informatics, Eger, 2010, vol. 2, pp. 191-197 (2011)
    -->Link   -->PDF  cit. (Scholar): 5

  50. Letchford, A.N., Reinelt, G., Seitz, H., Theis, D. O.
    On a class of metrics related to graph layout problems
    Linear Algebra and Applications 433(11-12), 1760-1777 (2010)
    -->Link   -->PDF cit. (Scholar): 3

  51. Schramm, G., Surmann, E.-M., Wiesberg, S., Oswald, M., Reinelt, G., Eils, R., König, R.
    Analyzing the regulation of metabolic pathways in human breast cancer
    BMC Medical Genomics 3(39), 1-10 (2010)
    -->Link  cit. (Scholar): 65

  52. Wang, P. Reinelt, G.
    A Heuristic for an Earth Observing Satellite Constellation Scheduling Problem with Download Considerations
    Electronic Notes in Discrete Mathematics 36, 711-718. Elsevier, Amsterdam (2010)
    -->Link  cit. (Scholar): 27

  53. Jünger, M., Lieblijng, T.M, Naddef, D., Pulleyblank, W.R., Reinelt, G., Rinaldi, G. Wolsey, L.A. (eds.)
    Traces of the XII Aussois Workshop on Combinatorial Optimization
    Mathematical Programming B (2010) 124, 1-6 (2010)
    -->Link  cit. (Scholar): -

  54. Cocking, C., Helling, S., Oswald, M., Rammelsberg, P., Reinelt, G., Hassel, A.
    Using Discrete Optimization for Designing Dental Shade Guides
    Color Research and Application 35(3), 233-239 (2010)
    -->Link  cit. (Scholar): 8

  55. Schramm, G., Wiesberg, S., Kranz, A.L., Diessl, N., Sagulenko, V., Oswald, M., Reinelt, G., Westermann, F., Eils , R., König, R.
    PATHWAVE: discovering Patterns of Differentially Regulated Enzymes in Metabolic Pathways
    Bioinformatics 26(9), 1225-1231 (2010)
    -->Link  cit. (Scholar): 39

  56. Reinelt, G., Wenger, K.M.
    Generating Partitions of a Graph into a Fixed Number of Minimum Weight Cuts
    Discrete Optimization 7 (1-2), 1-12 (2010)
    -->Link  cit. (Scholar): 8

  57. Ritter, D. Mazur, J. Reinelt, G. Kaderali, L.
    Reconstructing Nonlinear Dynamic Models of Gene Regulation using Stochastic Sampling
    BMC Bioinformatics 10/448 (2009)
    -->Link  cit. (Scholar): 55

  58. Jünger, M. Liebling, T.L., Naddef, D., Nemhauser, G.L., Pulleyblank, W.R., Reinelt, G., Rinaldi, G., Wolsey, L.A (eds.)
    50 Years of Integer Programming 1958-2008 - From the Early Years to the State-of-the-Art
    Springer, Heidelberg (2010)
    -->Link  cit. (Scholar): 800

  59. Cocking, C., Cevirgen, E., Helling, S,. Oswald, M., Corcodel, N., Rammelsberg, P., Reinelt, G., Hassel, A.
    Colour Compatibility between teeth and dental shade guides in Quinquagenarians and Septuagenarians
    Journal of Oral Rehabilitation 36, 848-855 (2009)
    -->Link  cit. (Scholar): 45

  60. Wang, P., Tan, Y., Reinelt, G.
    A Comparison of Heuristic Methods for Scheduling Earth Observing Satellites Fleet
    2009 International Conference on Information Technology and Computer Science, Kiev, Ukraine, pp. 164-167 (2009)
    -->Link  cit. (Scholar): 9

  61. Oswald, M. Reinelt, G., Seitz, H.
    Applying mod-k-Cuts for solving linear ordering problems
    TOP 17(1), 158-170 (2009)
    -->Link  cit. (Scholar): 10

  62. Oswald, M. Reinelt, G.
    The Simultaneous Consecutive Ones Problem
    Theoretical Computer Science 410(21) 1986-1992 (2009)
    -->Link  cit. (Scholar): 17

  63. Vo, K. T., Reinelt, G.
    Parallel Computation for the Bandwidth Minimization Problem
    In: B. Fleischmann, K.H. Borgwardt, R. Klein, A. Tuma (eds.): Operations Research Proceedings 2008. Selected Papers of the
    Annual International Conference of the German Research Society (GOR), University of Augsburg, September 3-5, 2008, pp. 481-486
    Springer, Heidelberg (2009)
    -->Link  cit. (Scholar): 12

  64. Cocking, C., Reinelt, G.
    Heuristics for Budget facility Location-Network Design Problems with Minisum Objective
    In: B. Fleischmann, K.H. Borgwardt, R. Klein, A. Tuma (eds.): Operations Research Proceedings 2008. Selected Papers of the
    Annual International Conference of the German Research Society (GOR), University of Augsburg, September 3-5, pp. 563-568
    Springer, Heidelberg (2009)
    -->Link  cit. (Scholar): -

  65. Sager, S., Bock, H.-G., Reinelt, G.
    Direct Methods with Maximal Lower Bound for Mixed-Integer Optimal Control Problems
    Mathematical Programming 118(1), 109-149 (2009)
    -->Link   -->PDF  cit. (Scholar): 154

  66. Békési, B., Galambos, G., Oswald, M., Reinelt, G.
    Improved Analysis of an Algorithm for the Coupled Task Problem with UET Jobs
    Operations Research Letters 37(2), 93-96 (2009)
    -->Link  cit. (Scholar): 20

  67. Reinelt, G., Theis, D.O., Wenger, K.M.
    Computing Finest Mincut Partitions of a Graph and Application to Routing Problems
    Discrete Applied Mathematics 156(3) 385-396 (2008)
    -->Link  cit. (Scholar): 6

  68. Reinelt, G., Theis, D. O.
    On the General Routing polytope
    In: A. Clark, R.W. Eglese, A.N. Letchford, M.B. Wright (eds.) Discrete Applied Mathematics. Special Issue on the Optimization
    Conference (CO'04), Lancaster (UK), March 28-31, 2004, vol. 158(3), pp. 368-384. Elsevier, München (2008)
    -->Link  cit. (Scholar): 6

  69. Surapholchai, C., Reinelt, G., Bock, H.-G.
    Solving City Bus Scheduling Problems in Bangkok by Eligen-Algorithm
    In: Bock, H.G., Kostina, E., Phu, H.X., Rannacher, R. (eds.): Modeling, Simulation and Optimization of Complex
    Processes, pp 557-564, Springer, Berlin, Heidelberg
    -->Link  cit. (Scholar): 11

  70. Balogh, J., Békési, J., Galambos, G., Reinelt, G.
    Lower Bound for the Online Bin Packing Problem with Restricted Repacking
    SIAM J. on Computing 38 (1), 398-410 (2008)
    -->Link  cit. (Scholar): 38

  71. Letchford, A.N., Reinelt, G., Theis, D.O.
    Odd minimum cut-sets and b-matchings revisited
    SIAM J. Discrete Math. 22(4), 1480-1487 (2008)
    -->Link  cit. (Scholar): 78

  72. Suh, J., Jung, S., Pfeifle, M., Vo, K.T., Oswald, M., Reinelt, G.
    Compression of Digital Road Networks
    In: Advances in Spatial and Temporal Databases, Proc. 10th International Symposium (SSTD), Boston, MA, USA, July 16-18, 2007,
    Lecture Notes in Computer Science, vol. 4605, pp. 423-440. Springer, Heidelberg (2007)
    -->Link  cit. (Scholar): 11

  73. Oswald, M., Reinelt, G., Theis, D.O.
    On the Graphical Relaxation of the Symmetric Traveling Salesman Polytope
    Mathematical Programming B 110(1), 175-193 (2007)
    -->Link  cit. (Scholar): 11

  74. Noé, F., Oswald, M., Reinelt, G.
    Optimizing in graphs with expensive computation of edge weights
    In: J. Kalcsics and S. Nickel (eds.): Operations Research Proceedings 2007. Selected Papers of the Annual Conference
    of the German Operations Research Society (GOR), Saarbrücken, September 5-7, 2007, vol. 2007, pp. 435-440
    Springer, Heidelberg (2008)
    -->Link   -->PDF  cit. (Scholar): 6

  75. Sager, S., Bock, H.-G., Diehl, M., Reinelt, G., Schlöder, J.P.
    Numerical methods for optimal control with Binary Control Functions Applied to a Lotka-Volterra Type Fishing Problem
    In: A. Seeger (ed.) Recent Advances in Optimization. Proc. of the 12th French-German-Spanish Conference on
    Optimization held in Avignon (France), September 20-24, 2004. Lectures Notes in Economics and Mathematical Systems,
    vol. 563, pp. 269-289. Springer, Heidelberg (2006)
    -->Link   -->PDF  cit. (Scholar): 64

  76. Ahr, D., Reinelt, G.
    A Tabu Search Algorithm for the Min-Max k-Chinese Postman Problem
    Computers and Operations Research 33 (12), 3403-3422 (2006)
    -->Link  cit. (Scholar): 102

  77. Reinelt, G., Wenger, K.M.
    Maximally Violated Mod-p Cuts for the Capacitated Vehicle Routing Problem
    INFORMS Journal on Computing 18(4), 466-479 (2006)
    -->Link  cit. (Scholar): 10

  78. Cocking, C., Fleßa, S., Reinelt, G.
    Locating Health Facilities in Nouna District, Burkina Faso
    In: H.-D. Haasis, H. Kopfer, J. Schönberger (eds.): Operations Research Proceedings 2005. Selected Papers of the
    Annual International Conference of the German Operations Research Society (GOR), Bremen, September 7-9, 2005, pp. 431-436
    Springer, Heidelberg (2006)
    -->Link  cit. (Scholar): 31

  79. Theis, D.O., Reinelt, G.
    A note on the Undirected Rural Postman Problem polytope
    Mathematical Programming A 106 (3), 447-452 (2006)
    -->Link  cit. (Scholar): 11

  80. König, R., Schramm, G., Oswald, M., Seitz, H., Sager, S., Zapatka, M., Reinelt, G., Eils, R.
    Discovering functional gene expression patterns in the metabolic network of Escherichia coli with wavelets transforms
    BMC Bioinformatics 7(1), 119-133 (2006)
    -->Link   -->PDF  cit. (Scholar): 30

  81. Van Tran, H., Reinelt, G., Bock, H.-G.
    BoxSteps Methods for Crew Pairing Problems
    Optimization and Engineering 7(1), 33-46 (2006)
    -->Link  cit. (Scholar): 14

  82. Noé, F., Oswald, M., Reinelt, G., Smith, J.C., Fischer, S.
    Computing Best Transition Pathways in High-Dimensional Dynamical Systems
    SIAM Multiscale Modeling and Simulation 5(2), 393-419 (2006)
    -->Link  cit. (Scholar): 29

  83. Oswald, M., Theis, D.O., Reinelt, G.
    Not every GTSP facet induces an STSP facet
    In: M. Jünger, V. Kaibel (eds.): 11th International IPCO Conference Proceedings, Berlin, Germany, June 8-10, 2005,
    Lecture Notes in Computer Science, vol. 3509, pp. 468-482. Springer, Heidelberg (2005)
    -->Link  cit. (Scholar): 13

  84. Van Tran, H., Reinelt, G., Bock, H.-G.
    Advanced Columns Generation Technique for Crew Pairing Problems
    In: Bock, H.-G, Kostina, E., Hoang, X.P., Rannacher, R. (eds.) Proc. of International Conference on High Performance
    Scientific Computing: Modelling, Simulation and Optimization of Complex Processes,
    Hanoi, Vietnam, March 10-14 2003, pp. 203-214. Springer, Heidelberg (2005)
    -->Link  cit. (Scholar): 2

  85. Theis, D.O., Reinelt, G.
    Transformation of Facets of the General Routing Problem Polytope
    SIAM Journal on Optimization 16(1), 220-234 (2005)
    doi.org/10.1137/040607307
    -->Link  cit. (Scholar): 0

  86. Liers, F., Jünger, M., Reinelt, G., Rinaldi, G.
    Computing Exact Ground States of Hard Ising Spin Glass Problems by Branch-and-Cut
    In: Hartmann, A.K., Rieger, H. (eds.) New Optimization Algorithms in Physics, pp. 47-70, Wiley-VCH, Weinheim (2004) -->Link  cit. (Scholar): 128

  87. Letchford, A.N., Theis, D.O., Reinelt, G.
    A Faster Exact Separation Algorithm for Blossom Inequalities
    In:Bienstock, D., Nemhauser, G. (eds.) Integer Programming and Combinatorial Optimization, 10th International IPCO Conference,
    New York, June 7-11 2004, Lecture Notes in Computer Science, vol. 3064, pp. pp. 196-205. Springer, Heidelberg (2004)
    -->Link  cit. (Scholar): 0

  88. Ahr, D., Békési, J., Galambos, G., Oswald, M., Reinelt, G.
    An Exact Algorithm for Scheduling Identical Coupled Tasks
    Mathematical Methods of Operations Research 59(2), 193-203 (2004)
    -->Link  cit. (Scholar): 76

  89. Oswald, M., Reinelt, G.
    Computing Optimal Consecutive Ones Matrices
    In: Grötschel, M. (ed.) The Sharpest Cut, The Impact of Manfred Padberg and His Work. MPS-SIAM series on optimization,
    pp. 173-184, Society for Industrial and Applied Mathematics, Philadelphia, (2004)
    -->Link  cit. (Scholar): 7

  90. Jünger, M., Reinelt, G.
    Combinatorial Optimization and Integer Programming
    In: U. Derigs (ed.): Encyclopedia of Life Support Systems Eolss 6.5: Optimization and Operations Research,
    pp. 321-327. Eolss, Oxford (2004)
    -->Link  cit. (Scholar): 7

  91. Wenger, K.M., Reinelt, G.
    Small Instance Relaxations for the Traveling Salesman Problem
    In: Ahr, D., Fahrion, R., Oswald, M., Reinelt, G. (eds.) Operations Research 2003. Selected Papers of the Int. Conf.
    on Operations Research 2003 (OR'03), Heidelberg, September 3-5 2003. Operations Research Proceedings, pp. 371-378.
    Springer, Heidelberg (2004)
    -->Link  cit. (Scholar): 3

  92. Van Tran, H, Reinelt, G., Bock, H.-G.
    A Parallel Approach to the Pricing Step in Crew Scheduling Problems
    In: Ahr, D., Fahrion, R., Oswald, M., Reinelt, G. (eds.) Operations Research 2003. Selected Papers of the Int. Conf.
    on Operations Research 2003 (OR'03), Heidelberg, September 3-5 2003. Operations Research Proceedings, pp. 165-172.
    Springer, Heidelberg (2004)
    -->Link  cit. (Scholar): 1

  93. Ahr, D., Fahrion, R., Oswald, M., Reinelt, G.
    Operations Research 2003. Selected Papers of the Int. Conf. on Operations Research 2003 (OR'03)
    Springer, Heidelberg (2004)
    -->Link  cit. (Scholar): 4

  94. Oswald, M., Reinelt, G.
    The Weighted Consecutive Ones Problem for a Fixed Number of Rows or Columns
    Operations Research Letters 31 (5), 350-356 (2003)
    -->Link  cit. (Scholar): 8

  95. Jünger, M., Reinelt, G., Rinaldi, G. (eds.)
    Combinatorial Optimization - Eureka, You Shrink!
    Papers Dedicated to Jack Edmonds, 5th International Workshop, Aussois, France, March 5-9 2001, Revised Papers,
    Lecture Notes in Computer Science, vol. 2570. Springer, Heidelberg (2003)
    -->Link  cit. (Scholar): 22

  96. Oswald, M., Reinelt, G.
    Constructing New Facets of the Consecutive Ones Polytope
    In: Jünger, M. Reinelt, G., Rinaldi, G. (eds.): Combinatorial Optimization - Eureka, You Shrink!, Papers Dedicated to Jack Edmonds,
    5th International Workshop, Aussois, France, March 5-9 2001, Revised Papers,
    Lecture Notes in Computer Science, vol. 2570, pp. 147-157. Springer, Heidelberg (2003)
    -->Link  cit. (Scholar): 0

  97. Ahr, D., Reinelt, G.
    New Heuristics and Lower Bounds for the Min-Max k-Chinese Postman Problem
    In: Möhring, R., Raman, R. (eds.) Algorithms - ESA 2002. Proc. 10th Annual European Symposium, Rome, Italy, S
    eptember 17-21 2002, Lecture Notes in Computer Science, vol. 2461, pp. 64-74. Springer, Heidelberg (2002)
    -->Link <  cit. (Scholar): 59

  98. Oswald, M., Reinelt, G.
    Some Relations Between Consecutive Ones and Betweenness Polytopes
    In: Chamoni, P., Leisten, R., Martin, A., Minnemann, J., Stadler, H. (eds.) Operations Research 2001. Selected Papers
    of the International Conference on Operations Research 2001 (OR'01), Duisburg, September 3-5 2001. pp. 277-283,
    Springer, Heidelberg (2002)
    -->Link  cit. (Scholar): 3

  99. Christof, T., Reinelt, G.
    Algorithmic Aspects of Using Small Instance Relaxations in Parallel Branch-and-Cut
    Algorithmica 30(4), 597-629 (2001)
    -->Link  cit. (Scholar): 26

  100. Christof, T., Reinelt, G.
    Decomposition and Parallelization Techniques for Enumerating the Facets of Combinatorial Polytopes
    International Journal of Computational Geometry & Applications 11(4), 423-437 (2001)
    -->Link  cit. (Scholar): 47

  101. Oswald, M., Reinelt, G.
    Polyhedral Aspects of the Consecutive Ones Problem
    In: Du, D.-Z., Eades, P., Estivill-Castro, V. et al. (eds.) Computing and Combinatorics, Proc. of the 6th Annual Int. Conf. on
    Computing and Combinatorics, (COCOON 2000), Sydney, Australia, July 26-28 2000,
    Lecture Notes in Computer Science, vol. 1858, pp. 373-382. Springer, Heidelberg (2000)
    -->Link  cit. (Scholar): 11

  102. Ascheuer, N., Jünger, M., Reinelt, G.
    A Branch-and-Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints
    Computational Optimization and Applications 17(1), 61-84 (2000)
    -->Link  cit. (Scholar): 1

  103. Oswald, M., Reinelt, G
    Polyhedral Aspects of the Consecutive Ones Problem
    In: K. Inderfurth, G. Schwödiauer, W. Domschke, F. Juhnke, P. Kleinschmidt, G. Wäscher (eds.): Operations Research 1999.
    Selected Papers of the Symposium on Operations Research (SOR'99), Magdeburg, September 1-3, 1999,. pp. 81-85,
    Springer, Heidelberg (2000)
    -->Link  cit. (Scholar): -

  104. Christof, T., Oswald, M., Reinelt, G.
    Consecutive Ones and a Betweenness Problem in Computational Biology
    In: Bixby, R.E., Boyd, E.A., Ríos-Mercado, R.Z. (eds.) Integer Programming and Combinatorial Optimization,
    6th International IPCO conference, Houston, Texas, USA, June 22-24, 1998, Proceedings,
    Lecture Notes in Computer Science, vol. 1412, pp. 213-228. Springer, Heidelberg (1998)
    -->Link  cit. (Scholar): 41

  105. Jünger, M., Reinelt, G., Rinaldi, G.
    The Traveling Salesman Problem: A Bibliography
    In: Dell'Amico, M., Maffioli, F., Martello, S. (eds.): Annotated Bibliographies in Combinatorial Optimization, pp. 199-221,
    Wiley, Chichester (1997)
    -->Link  cit. (Scholar): 3

  106. Christof, T., Jünger, M., Kececioglu, J., Mutzel, P., Reinelt, G.
    A Branch-and-Cut Approach to Physical Mapping of Chromosomes by Unique End-probes
    Journal of Computational Biology 4(4), 433-447 (1997)
    -->Link  cit. (Scholar): 39

  107. Christof, T., Jünger, M., Kececioglu, J., Mutzel, P., Reinelt, G.
    A Branch-and-Cut Approach to Physical Mapping with End-probes
    In: Proc. of the First Annual Conference on Computational Molecular Biology RECOMB, pp. 84-92 (1997)
    -->Link  cit. (Scholar): 24

  108. Funke, M., Reinelt, G.
    A Polyhedral Approach to the Feedback Vertex Set Problem
    In: Cunningham, W. H., S., McCormick, S.T., Queyranne, M. (eds.) Proc. 5th International Conference on Integer Programming
    and Combinatorial Optimization, Vancouver, British Columbia, Canada, June 3-5 1996,
    Lecture Notes in Computer Science, vol. 1084, pp. 445-459. Springer, Heidelberg (1996)
    -->Link  cit. (Scholar): 34

  109. De Simone, C., Diehl, M., Jünger, M., Mutzel, P., Reinelt, G., Rinaldi, G.
    Exact Ground States of Two-Dimensional +-J Ising Spin Glasses
    Journal of Statistical Physics 84, 1363-1371 (1996)
    -->Link  cit. (Scholar): 90

  110. Christof, T., Reinelt, G.
    Combinatorial Optimization and Small Polytopes
    Top 4(1), 1-53 (1996)
    -->Link  cit. (Scholar): 99

  111. De Simone, C., Diehl, M., Jünger, M., Mutzel, P., Reinelt, G., Rinaldi, G.
    Exact Ground States of Ising Spin Glasses: New Experimental Results with a Branch and Cut Algorithm
    Journal of Statistical Physics 80(1-2), 487-496 (1995)
    -->Link  cit. (Scholar): 238

  112. Jünger, M., Reinelt, G., Rinald, G.
    The Traveling Salesman Problem
    In: Ball, M., Magnanti, T., Monma, C.L., Nemhauser, G. (eds.): Network Models. Handbooks in Operations Research
    and Management Sciences, vol. 7, pp. 225-330, North Holland, Amsterdam (1995)
    -->Link  cit. (Scholar): 838

  113. Christof, T., Reinelt, G.
    Parallel Cutting Plane Generation for the TSP
    In: Fritzson, P., Finmo, L. (eds.) Parallel Programming and Applications. pp. 163-169. IOS Press, Amsterdam (1995)
    -->Link   -->PDF  cit. (Scholar): 16

  114. Reinelt, G.
    Kombinatorische Optimierung und VLSI-Entwurf
    In: Bachem, A., Jünger, M., Schrader, R. (eds.) Mathematik in der Praxis. pp. 237-260. Springer, Heidelberg (1995)
    -->Link  cit. (Scholar): -

  115. Jünger, M. Reinelt, G., Thienel, S.
    Practical Problem Solving with Cutting Plane Algorithms in Combinatorial Optimization
    In: Cook, W., Lovász, L., Seymour, P. (eds): Combinatorial Optimization: Papers from DIMACS special year,
    DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 20, pp. 111-152 (1995)
    -->Link  cit. (Scholar): 193

  116. Reinelt, G.
    The Traveling Salesman: Computational Solutions for TSP Applications
    Lecture Notes in Computer Science, vol. 840, Springer, Heidelberg (1994)
    -->Link  cit. (Scholar): 1679

  117. Jünger, M., Martin, A., Reinelt, G., Weismantel, R.
    Quadratic 0/1-Optimization and a Decomposition Approach for the Placement
    Mathematical Programming 63(3), 257-279 (1994)
    -->Link  cit. (Scholar): 70

  118. Jünger, M., Reinelt, G., Thienel, S.
    Provably Good Solutions for the Traveling Salesman Problem
    ZOR - Methods and Models of Operations Research 40(2), 183-217 (1994)
    -->Link  cit. (Scholar): 97

  119. Jünger, M., Reinelt, G.
    Verfahrwegoptimierung bei Maskenerstellung und Produktion von Leiterplatten
    DGOR-Praxisbericht 2 (1994)
    -->PDF  cit. (Scholar): -

  120. Reinelt, G
    A Note on small linear-ordering polytopes
    Discrete & Computational Geometry 10(1), 67-78 (1993)
    -->Link  cit. (Scholar): 43

  121. Jünger, M., Reinelt, G.
    Schnittebenenverfahren in der Kombinatorischen Optimierung
    GAMM Mitteilungen, 15(2), 120-134 (1992)
    -->PDF  cit. (Scholar): 2

  122. Reinelt, G.
    Fast Heuristics for Large Geometric Traveling Salesman Problems
    ORSA Journal on Computing 4 (2), 206-217 (1992)
    -->Link  cit. (Scholar): 121

  123. Grötschel, M. Jünger, M., Reinelt, G.
    Optimal Control of Plotting and Drilling Machines: A Case Study
    Zeitschrift für Operations Research (ZOR) 35(1), 61-84 (1991)
    -->Link   -->PDF  cit. (Scholar): 128

  124. Borgwardt, K.H., Gaffke, N., Jünger, M., Reinelt, G.
    Computing the Convex Hull in the Euclidean Plane in Linear Expected Time
    In: Gritzmann, P., Sturmfels, B. (eds.): The Victor Klee Festschrift, DIMACS Series in Discrete Mathematics and
    Theoretical Computer Science, vol. 4, pp. 91-107, American Mathematical Society (1991)
    -->Link  cit. (Scholar): 12

  125. Jünger, M. Reinelt, G., Zepf, D.
    Computing Correct Delaunay Triangulations
    Computing 47(1), 43-49 (1991)
    -->Link  cit. (Scholar): 19

  126. Reinelt, G.
    TSPLIB - A Traveling Salesman Problem Library
    In: Hamacher, H. (ed.): OR Software - ORSEP Operations Research Software Exchange Program,
    European Journal of Operational Research 52, 125 (1991)
    -->Link  cit. (Scholar): -

  127. Reinelt, G.
    TSPLIB - A Traveling Salesman Problem Library
    ORSA Journal on Computing 3(4), 376-384 (1991)
    -->Link  cit. (Scholar): 4547

  128. Christof, T., Jünger, M., Reinelt, G.
    A Complete Description of the Traveling Salesman Polytope on 8 Nodes
    Operations Research Letters 10(9), 497-500 (1991)
    -->Link  cit. (Scholar): 72

  129. Jünger, M. Martin, A., Reinelt, G., Weismantel, R.
    Simultaneous Placement in the Sea Of Gates Layout Style
    In: (Rieder, U., Gessner, P., Peyerimhoff, A., Radermacher, F.J. (eds.): Proc. XIV. Symposium on Operations Research,
    University of Ulm, Sep. 6-8, 1989, Methods of Operations Research 62 , 273-275 (1990)
    -->Link  cit. (Scholar): 1

  130. Reinelt, G.
    Polyedrische Methoden zur Lösung großer kombinatorischer Optimierungsprobleme
    In: Andreas Reuter (ed.): GI - 20. Jahrestagung II, Informatik auf dem Weg zum Anwender, Stuttgart, Oktober 8-12, 1990
    Proc. Informatik-Fachberichte, vol. 258, pp. 517-526, Springer, Heidelberg (1990)
    -->Link  cit. (Scholar): 1

  131. Barahona, F. Jünger, M., Reinelt, G.
    Experiments in Quadratic 0-1 Programming
    Mathematical Programming 44(2), 127-138 (1989)
    -->Link  cit. (Scholar): 323

  132. Grötschel, M., Jünger, M., Reinelt, G.
    Via Minimization with Pin Preassignments and Layer Preference
    Zeitschrift für Angewandte Mathematik und Mechanik 69(11), 393-399 (1989)
    -->Link   -->PDF  cit. (Scholar): 40

  133. Barahona, F., Grötschel, M., Jünger, M., Reinelt, G.
    An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
    Operations Research 36(3), 493-513 (1988)
    -->Link   -->PDF  cit. (Scholar): 802

  134. Grötschel, M., Jünger, M., Reinelt, G.:
    Calculating Exact Ground States of Spin Glasses: A Polyhedral Approach
    In: Hemmen, J.L. van, Morgenstern, I. (eds.): Heidelberg Colloquium on Glassy Dynamics, University of Heidelberg, June 9 - 13, 1986,
    Lecture Notes in Physics 275, 325-353, Springer, Heidelberg (1987)
    -->Link   -->PDF  cit. (Scholar): 28

  135. Euler, R., Jünger, M., Reinelt, G.
    Generalizations of Cliques, Odd Cycles and Anticycles and Their Relation to Independence System Polyhedra
    Mathematics of Operations Research 12(3), 451-462 (1987)
    -->Link  cit. (Scholar): 53

  136. Grötschel, M. Jünger, M., Reinelt, G.
    Acyclic Subdigraphs and Linear Orderings: Polytopes, Facets and a Cutting Plane Algorithm
    In: Rival, I. (ed.): Graphs and Order. NATO ASI Series, vol 147 pp. 217-264. Springer, Dordrecht (1985)
    -->Link   -->PDF  cit. (Scholar): 27

  137. Grötschel, M., Jünger, M., Reinelt, G.
    On the Acyclic Subgraph Polytope
    Mathematical Programming 33(1), 28-42 (1985)
    -->Link   -->PDF  cit. (Scholar): 176

  138. Grötschel, M., Jünger, M., Reinelt, G.
    Facets of the Linear Ordering Polytope
    Mathematical Programming 33(1), 43-60 (1985)
    -->Link   -->PDF  cit. (Scholar): 271

  139. Reinelt, G.
    The Linear Ordering Problem: Algorithms and Applications
    Research and Expositions in Mathematics 8, Heldermann Verlag, Lemgo (1985)
    -->Link  cit. (Scholar): 268

  140. Jünger, M., Reinelt, G., Pulleyblank, W.R.
    On Partitioning the Edges of Graphs into Connected Subgraphs
    Journal of Graph Theory 9 (4), 539-549 (1985)
    -->Link  cit. (Scholar): 72

  141. Grötschel, M., Jünger, M., Reinelt, G.
    A Cutting Plane Algorithm for the Linear Ordering Problem
    Operations Research 32(6), 1195-1220 (1984)
    -->Link   -->PDF  cit. (Scholar): 520

  142. Grötschel, M., Jünger, M., Reinelt, G.
    Optimal Triangulation of Large Real World Input-Output Matrices
    Statistische Hefte 25(1), 261-295 (1984)
    -->Link   -->PDF  cit. (Scholar): 58

  143. Jünger, M., Reinelt, G.
    Techniques and machines in the history of computing
    In: Symposium Volume, XI International Symposium on Mathematical Programming, Universität Bonn, August 23-27, 1982, pp. 103-115
    Institut für Ökonometrie und Operations Research, Rheinische Friedrich-Wilhelms-Universität Bonn, Bonn (1982)
    -->PDF  cit. (Scholar): -

    (Google scholar citations as at June 2026)