Publications

• 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, Elsevier (2013). doi: 10.1016/j.endm.2013.05.079
   
• Kappes, J. H., Speth, M., Reinelt, G., Schnörr, C.: Higher-order Segmentation via Multicuts.
  Technical Report; Referenz http://arxiv.org/abs/1305.6387, (2013).
   
• Bonato, T., Jünger, M., Reinelt, G., Rinaldi, G.: Lifting and separation procedures for the cut polytope.
  to appear in: Mathematical Programming, (2013).
   
• 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.
  to appear in: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR), (2013).
   
• Reinelt, G., Seitz, H.: On a Binary Distance Model for the Minimum Linear Arrangement Problem
  to appear in: TOP, Journal of the Spanish Society of Statistics and Operations Research (2013)
   
• Hassel, A., Zenthöfer, A., Corcodel, N., Hildenbrandt, A., Reinelt, G., Wiesberg, S.: Determine VITA Classical Shades with 3D Master Shade Guide. Acta Odontologica Scandinavica 71(3-4), 721-726, (2013).
   
• Oswald, M., Reinelt, G., Wiesberg, S.: Exact Solution of the 2-Dimensional Grid Arrangement Problem. Discrete Optimization 9(3), 189-199 (2012). doi:10.1016/j.disopt.2012.07.002
   
• 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). doi=10.1103/PhysRevA.85.063603
   
• Balogh, J., Békési, J., Galambos G., Reinelt, G.: On-line bin packing with restricted repacking. Journal of Combinatorial Optimization. (2012). doi:10.1007/s10878-012-9489-4
   
• 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). doi:10.1016/j.omega.2012.01.006
   
• 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). doi:10.1016/j.seps.2011.12.04
   
• 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). doi:10.1007/s10107-010-0399-x
   
• 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). doi:10.1007/s10589-010-9384-9
   
• 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). doi:10.1111/j.1475-3995.2011.00805.x
   
• 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). doi:10.1016/j.cie.2011.02.015
   
• Vo, T.K.: Exact and Heuristic Solutions to the Bandwidth Minimization Problem. Dissertation, Universität Heidelberg (2011)
   
• Kappes, J.H.: Inference on Highly-Connected Discrete Graphical Models with Applications to Visual Object Recognition. Dissertation, Universität Heidelberg (2011)
   
• Bonato, T.: Contraction-based separation and lifting for solving the max-cut problem. Dissertation, Universität Heidelberg (2011)
   
• 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 International Conference 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)
   
• 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)
   
• Caprara, A., Oswald, M., Reinelt, G., Schwarz, R. Traversi, E.: Optimal linear arrangements using betweenness variables. Mathematical Programming Computation 3(3), 261-280 (2011). doi:10.1007/s12532-011-0027
   
• Martí, R., Reinelt, G.: The Linear Ordering Problem. Exact and Heuristic Methods in Combinatorial Optimization. Springer, Heidelberg (2011)
   
• 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). doi:10.1007/s10878-009-9264-3
   
• 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). doi:10.1186/1755-8794-3-39
   
• Kirches, C.: Fast Numerical Methods for Mixed-Integer Nonlinear Model-Predictive Control . Dissertation, Universität Heidelberg (2010)
• Wang, P. Reinelt, G.: A Heuristic for an Earth Observing Satellite Constellation Scheduling Problem with Download Considerations. In: M. Haouari, A.R. Mahjoub (eds.): Proceedings of ISCO 2010 - International Symposium on Combinatorial Optimization, Hammamet, Tunisia, March 24-26, 2010. Electronic Notes in Discrete Mathematics, vol. 36, pp. 711-718. Elsevier, Amsterdam (2010)
   
• 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 (2010)
   
• Seitz, H.: Contributions to the Minimum Linear Arrangement Problem. Südwestdeutscher Verlag für Hochschulschriften, München (2010)
   
• Buchheim, C., Liers, F., Oswald, M.: Speeding up IP-based Algorithm for Constrained Quadratic 0-1 Optimization. Mathematical Programming B, 124(1-2), 513-535 (2010)
   
• 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). doi:10.1016/j.laa.2010.06.038
   
  
• Seitz, H.: Contributions to the Minimum Linear Arrangement Problem. Dissertation, Universität Heidelberg (2010)
   
• Schramm, G., Wiesberg, S., Kranz, A.L., Diessl, N., Sagulenko, V., Oswald, M., Reinelt, G., Westermann, F., Eils , R., König, R.: Discovering Patterns of Differentially Regulated Enzymes in Metabolic Pathways. Bioinformatics 26(9), 1225-1231 (2010). doi:10.1093/bioinformatics/btq113
   
• 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). doi:10.1016/j.disopt.2009.07.001
   
• 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)
   
• 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)
   
• Suramann, E.M. Schramm, G. Wiesberg, S., Oswald, M., Reinelt, G.. Eils, R. König, R.: Analyzing the regulation of metabolic pathways in human breast cancer. In: Benz, D., Janssen, F. (eds) Proceedings of the KDML 2009: Knowledge Discovery, Data Mining, and Machine Learning, Darmstadt, September 21-23, 2009, pp. 111-119. Darmstadt (2009)
   
• Fatumo, S. Plaimas, K., Mallm, J.-P., Schramm, G., Adebigi, E., Oswald, M,. Eils, R., König, R.: : Estimating novel potential drug targets of Plasmodium falciparum by analysing the metabolic network of knock-out strains in silico. Infection, Genetics and Evolution 9(3), 351-258 (2009). doi:10.1016/j.meegid.2008.01.007
   
• 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). doi:10.1111/j.1365-2842.2009.02003.x
   
• Oswald, M., Reinelt, G., Theis, D.O.: The Geometry of the Graphical Relaxation of the Symmetric Traveling Salesman Polytope. Technical Report, 2009
   
• Ritter, D. Mazur, J. Reinelt, G. Kaderali, L.: Reconstructing Nonlinear Dynamic Models of Gene Regulation using Stochastic Sampling. BMC Bioinformatics 10(448). 12 pages (2009)
  DOI: 10.1186/1471-2105-10-448
   
• Oswald, M. Reinelt, G.: The Simultaneous Consecutive Ones Problem. Theoretical Computer Science 410(21), 1986-1992 (2009). doi:10.1016/j.tcs.2008.12.039
   
• Oswald, M. Reinelt, G., Seitz, H.: Applying mod-k-Cuts for solving linear ordering problems. TOP 17(1), 158-170 (2009). doi:10.1007/s11750-009-0096-1
   
• 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 German Research Society (GOR), University of Augsburg, September 3-5, 2008, pp. 481-486. Springer, Heidelberg (2009)
   
• 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 German Research Society (GOR), University of Augsburg, September 3-5, pp. 563-568, Springer, Heidelberg (2009)
   
• 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). doi:10.1016/j.orl.2008.11.002
   
• 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)
   
• Theis, D.O.: Subdividing the Polar of a Face. Technical Report (2008)
   
• Cocking, C.: Finding an Optimal Tooth Color Match. Crossroads, the ACM Student Magazine 14(3), 22-25 (2008)
   
• Plaimas, K., Mallm, J.-P., Oswald, M. Svara, F., Sourjik, V., Eils, R., König, R.: Machine learning based analyses on metabolic networks supports high-throughput knockout screens. BMC Systems Biology 2(67), 11 pages (2008)
   
• Buchheim, C. Liers, F. Oswald, M.: Local cuts revisited. Operations Research Letters 36(4), 430-433 (2008). doi:10.1016/j.orl.2008.01.004
   
• Balógh, J., Békési, J., Galambos, G., Reinelt, G.: The generalized packing pattern technique for bin-packing lower bounds. Technical Report (2008)
   
• 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)
   
• Letchford, A.N., Reinelt, G., Theis, D.O.: The Odd minimum cut-sets and b-matchings revisited. SIAM J. Discrete Math. 22(4), 1480-1487 (2008). doi:10.1137/060664793
   
• 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)
   
• Cocking, C.: Solutions to Facility Location-Network Design Problems. Dissertation, Universität Heidelberg (2008)
   
• Fiorini, F., Oriolo, G., Sanità, L., Theis, D.O.: The Virtual Private Network Design Tree Routing Conjecture for Outerplanar Networks. Technical Report (2008)
   
• Cocking, C., Cervirgen, E,. Hellin, S., Oswald, M., Corcodel, N., Rammelsberg, P., Reinelt G., Hassel,A.: Color compatibility between teeth and dental shade guides in Quinquagenarians and Septuagenarians. Technical Report (2008)
   
• Reinelt, G., Theis, D.O., Wenger, K.M.: Computing Finest Mincut Partitions of a Graph and Application to Routing Problems. In: A. Clark, R.W. Eglese, A.N. Letchford, M.B. Wright (eds.) Discrete Applied Mathematics. Special Issue on the Combinatorial Optimization Conference (CO'04), Lancaster (UK), March 28-31, 2004. vol. 158(3), pp. 385-396. Elsevier, München (2008)
   
• 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 Combinatorial Optimization Conference (CO'04), Lancaster (UK), March 28-31, 2004. vol. 158(3), pp. 368-384. Elsevier, München (2008)
   
• 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)
   
• 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). doi:10.1007/s10107-006-0060-x
   
• Plaimas, K., Oswald, M., Eils, R., König, R.: Integrating Genomic and Transcriptomic Data into Graph Based Approaches for Defining Essential Reactions in the Metabolic Network of Escherichia Coli. In: Hinneburg, A. (ed.) LWA 2007: Lernen - Wissen - Adaption, Workshop Proceedings,, Halle September 2007, pp. 55-60, Halle (2007)
   
• Cocking, C., Cervirgen, E., Oswald, M., Rammelsberg, P., Reinelt, G., Hassel, A.: Spectral coverage of tooth color in the middle- and high-aged patient by Vita Classical and Vita 3D-Master. Technical Report (2007)
   
• Letchford, A.N., Seitz, H., Reinelt, G., Theis, D. O.: On convex sets associated with permutations, path-metrics and cuts. Technical Report (2007)
   
• 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). doi:10.1137/050641922
   
• 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)
   
• 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). doi:10.1287/ijoc.1040.0125
   
• 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)
   
• 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)
   
• 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)
   
• Harmsen, S.: Algorithmic Computer Reconstructions of Stalactite Vaults - Muqarnas - in Islamic Architecture. Dissertation, Universität Heidelberg (2006)
   
• Sager, S.: Numerical methods for mixed integer optimal control problems. Dissertation, Universität Heidelberg (2006)
   
• Noé, F.: Transition Networks : Computational Methods for the Comprehensive Analysis of Complex Rearrangements in Proteins. Dissertation, Universität Heidelberg (2006)
   
• Tran, H.V., Reinelt, G., Bock, H.-G.: BoxSteps Methods for Crew Pairing Problems. Optimization and Engineering 7(1), 33-46 (2006). doi:10.1007/s11081-006-6589-y
   
• Theis, D.O., Reinelt, G.: A note on the Undirected Rural Postman Problem polytope. Mathematical Programming A 106(3), 447-452 (2006). doi:10.1007/s10107-005-0640-1
   
• Surapholchai, C., Reinelt, G., Bock, H.-G.: Solutions to city bus scheduling problems. In: Lenbury, Yongwimon and Van Sanh, Nguyen (eds.): Contributions in Mathematics and Applications, East-West Journal of Mathematics, pp. 129-142 (2005)
   
• Theis, D.O., Reinelt, G.: Transformation of Facets of the General Routing Problem Polytope. SIAM Journal on Optimization 16(1), 220-234 (2005). doi:10.1137/040607307
   
• Oswald, M., Theis, D.O., Reinelt, G.: Not every GTSP facet induces an STSP facet. In: M. Jünger, V. Kaibel (eds.): Integer Programming and Combinatorial Optimization, 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings.Lecture Notes in Computer Science, vol. 3509, pp. 468-482. Springer, Heidelberg (2005)
   
• Theis, D.O.: Polyhedra and algorithms for the General Routing Problem. Dissertation, Universität Heidelberg (2005)
   
• Tran, V.H.: Solving Large Scale Crew Pairing Problems. Dissertation, Universität Heidelberg (2005)
   
• Ahr, Dino: Contributions to Multiple Postmen Problems. Dissertation, Universität Heidelberg (2004)
   
• Tran, V.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)
   
• 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)
   
• 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)
   
• Letchford, A.N., Theis, D.O., Reinelt, G.: A rather long note on the Padberg-Rao algorithm for capacitated blossom separation. Technical Report (2004) PS, PDF
   
• 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). doi:10.1007/s001860300328
   
• 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)
   
• Jünger, M., Reinelt, G.: Combinatorial Optimization and Integer Programming. In: 6.5: Optimization and Operations Research In: U. Derigs (ed.): Encyclopedia of Life Support Systems Eolss, pp. 321-327. Eolss, Oxford (2004)
   
• Fritz, T., Reinelt, G., Wenger, K.M.: Resolution Techniques in the Branch-and-Cut Approach to the Capacitated Vehicle Routing Problem. Technical Report (2004)
   
• 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 International Conference on Operations Research 2003 (OR'03), Heidelberg, September 3-5 2003. Operations Research Proceedings, pp. 371-378.
  Springer, Heidelberg (2004)
   
• Hoai, T.V., 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 International Conference on Operations Research 2003 (OR'03), Heidelberg, September 3-5 2003. Operations Research Proceedings, pp. 165-172.
  Springer, Heidelberg (2004)
   
• Ahr, D., Fahrion, R., Oswald, M., Reinelt, G. : Selected Papers of the International Conference on Operations Research 2003 (OR'03), Heidelberg, September 3-5 2003. Operations Research Proceedings. Springer, Heidelberg (2004)
   
• 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). doi:10.1016/S0167-6377(03)00024-5
   
• 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)
   
• 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)
   
• Oswald, M.: Weighted Consecutive Ones Problems. Dissertation, Universität Heidelberg, (2003)
   
• Wenger, K.M: Generic Cut Generation Methods for Routing Problems. Dissertation, Universität Heidelberg, 2003. Shaker Verlag (2004)
   
• Surapholchai, C., Kijsirikul, B., Hall, M. E.: Generalization of Clauses Containing Cross Connections. In: Proc. International Conference on Computational Mathematics and Modeling (IMM), Mahidol University, May 22-24, 2002, Bangkok, Thailand. Special Volume of East-West Journal of Mathematics, pp. 423-439. Mahidol University, Bangkok (2002)
   
• 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, September 17-21 2002. Lecture Notes in Computer Science, vol. 2461, pp. 64-74. Springer, Heidelberg (2002)
   
• Wenger, K.M.: A New Approach to Cactus Construction Applied to TSP Support Graphs. In: Cook, W.J., Schulz, A.S. (eds.) Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002. Lecture Notes in Computer Science, vol. 2337, pp. 109-126. Springer, Heidelberg (2002)
   
• 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)
   
• Christof, T., Reinelt, G.: Algorithmic Aspects of Using Small Instance Relaxations in Parallel Branch-and-Cut. Algorithmica 30(4), 597-629 (2001)
   
• 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)
   
• Wenger, K. M.: Kaktus-Repräsentationen der minimalen Schnitte eines Graphen und Anwendung im Branch-and-Cut Ansatz für das TSP. Diploma Thesis, Institut für Informatik, Universität Heidelberg (2001)
   
• Theis, D.O.: Das General Routing Problem mit binären Variablen. Diploma Thesis, Institut für Informatik, Universität Heidelberg (2001)
   
• Adams, B., Cadet, J., Du, L., Du, X., Surapholchai, C., Wang, X.: Modeling Cash Flows in Bond Structures. In: Gremaud, P.A., Zhilin, L., Smith, R.C., and Tran,H.T.: Proc. Industrial Mathematics Modeling Workshop for Graduate Students, North Carolina State University. Technical Report CRSC-TR00-24, pp. 25-47. (2000)
   
• 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 International Conference 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)
   
• 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). doi:10.1023/A:1008779125567
   
• 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)
   
• 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)
   
• Oswald, M.: PQ-Bäume im Branch-and-Cut-Ansatz für das Physical-Mapping-Problem mit Endprobes. Diploma Thesis, Institut für Angewandte Mathematik, Universität Heidelberg (1997)
   
   
• Christof, T.: Low-Dimensional 0/1-Polytopes and Branch-and-Cut in Combinatorial Optimization. Dissertation, Uni Heidelberg. Shaker Verlag (1997)
   
• 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)
   
• Christof, T., Reinelt, G.: Low-dimensional Linear Ordering Polytopes. Working Paper, Uni Heidelberg (1997)
   
• Funke, M.: Allgemeine Feedback Vertex Set Probleme. Dissertation, Uni Heidelberg. Herbert Utz Verlag (1997)
   
• Christof, T.: Low-dimensional 0/1-Polytopes and Branch-and -Cut in Combinatorial Optimization. Dissertation, Universität Heidelberg (1997)
   
• 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). doi:10.1089/cmb.1997.4.433
   
• 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)
   
• Funke, M., Reinelt, G.: A Polyhedral Approach to the Feedback Vertex Set. 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). doi:10.1007/3-540-61310-2_33
   
• 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(5/6), 1363-1371 (1996). doi:10.1007/BF02178370
   
• Funke, U.: Knapsack Probleme. Diploma Thesis, Institut für Informatik, Universität Heidelberg (1996)
   
• Christof, T., Reinelt, G.: Combinatorial Optimization and Small Polytopes. Top 4(1), 1-53 (1996). doi:10.1007/BF02568602
   
• 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)
   
• 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)
   
• 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)
   
• 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)
   
• 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)
   
• Reinelt, G.: The Traveling Salesman: Computational Solutions for TSP Applications. Lecture Notes in Computer Science, vol. 840. Springer, Heidelberg (1994). doi:10.1007/3-540-48661-5
   
• Jünger, M., Martin, A., Reinelt, G., Weismantel, R.: Quadratic 0/1-Optimization and a Decomposition Approach for the Placement of Electronic Circuits. Mathematical Programming 63(1-3), 257-280 (1994)
   
• Jünger, M., Reinelt, G., Thienel, S.: Provably Good Solutions for the Traveling Salesman Problem. Zeitschrift für Operations Research 40(2), 183-217 (1994)
   
• Jünger, M., Reinelt, G.: Verfahrwegoptimierung bei Maskenerstellung und Produktion von Leiterplatten. DGOR-Praxisbericht 2 (1994)
   
• Reinelt, G: A Note on small linear-ordering polytopes. Discrete & Computational Geometry 10(1), 67-78 (1993). doi:10.1007/BF02573963
   
• Jünger, M., Reinelt, G.: Schnittebenenverfahren in der Kombinatorischen Optimierung. GAMM Mitteilungen, 15(2), 120-134 (1992)
   
• Reinelt, G.: Fast Heuristics for Large Geometric Traveling Salesman Problems. ORSA Journal on Computing 4(2), 206-217 (1992). doi: 10.1287/ijoc.4.2.206
   
• 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)
   
• 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.: The Victor Klee Festschrift. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 4, pp. 91-107. American Mathematical Society (1991)
   
• Jünger, M. Reinelt, G., Zepf, D.: Computing Correct Delaunay Triangulations. Computing 47(1), 43-49 (1991)
   
• Reinelt, G.: TSPLIB - A Traveling Salesman Problem Library. ORSA Journal on Computing 3, 376-384 (1991)
   
• 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)
   
• Jünger, M. Martin, A., Reinelt, G., Weismantel, R.: Simultaneous Placement in the Sea Of Gates Layout Style. Methods of Operations Research 62, 273-275 (1990)
   
• 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)
   
• Barahona, F. Jünger, M., Reinelt, G.: Experiments in Quadratic 0-1 Programming. Mathematical Programming 44(1-3), 127-138 (1989)
   
• 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)
   
• 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)
   
• Grötschel, M., Jünger, M., Reinelt, G.: Calculating Exact Ground States of Spin Glasses: A Polyhedral Approach. In: J.L. van Hemmen, I. Morgenstern (eds.): Heidelberg Colloquium on Glassy Dynamics, Proc. of a Colloquium on Spin Glasses, Optimization and Neural Networks, Heidelberg, June 9-13, 1986, Lecture Notes in Physics, vol. 275, pp. 325-353. Springer, Heidelberg (1987)
   
• 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, 451-462 (1987)
   
• 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. The role of graphs in the theory of ordered sets and its applications. pp. 217-264. Reidel, Dordrecht (1985)
   
• Grötschel, M., Jünger, M., Reinelt, G.: On the Acyclic Subgraph Polytope. Mathematical Programming 33(1), 28-42 (1985)
   
• Grötschel, M., Jünger, M., Reinelt, G.: Facets of the Linear Ordering Polytope. Mathematical Programming 33(1), 43-60 (1985)
   
• Reinelt, G.: The Linear Ordering Problem: Algorithms and Applications. Research and Expositions in Mathematics (8), Heldermann Verlag, Lemgo (1985)
   
• 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)
   
• Grötschel, M., Jünger, M., Reinelt, G.: A Cutting Plane Algorithm for the Linear Ordering Problem. Operations Research 32(6), 1195-1220 (1984)
   
• Grötschel, M., Jünger, M., Reinelt, G.: Optimal Triangulation of Large Real World Input-Output Matrices. Statistische Hefte 25(1), 261-295 (1984). doi:10.1007/BF02932410
   
• 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)

mod. 04.06.13, CP