Gerhard Reinelt

103 papers A* 1A 1B 7Misc 3Journal 74Unranked 12

Year	Rank	Type	Title / Venue / Authors
2024	B	`conf`	PACE Solver Description: Exact Solution of the One-Sided Crossing Minimization Problem by the MPPEG Team. IPEC Michael Jünger, Paul J. Jünger, Petra Mutzel, Gerhard Reinelt
2024	J	`jnl`	PACE Solver Description: Exact Solution of the One-sided Crossing Minimization Problem by the MPPEG Team. CoRR Michael Jünger, Paul J. Jünger, Petra Mutzel, Gerhard Reinelt
2022	J	`jnl`	Comments on "An Exact Method for the Minimum Feedback Arc Set Problem". ACM J. Exp. Algorithmics Martin Grötschel, Michael Jünger, Gerhard Reinelt
2021	J	`jnl`	Quantum Annealing versus Digital Computing: An Experimental Comparison. ACM J. Exp. Algorithmics Michael Jünger, Elisabeth Lobe, Petra Mutzel, Gerhard Reinelt, Franz Rendl, Giovanni Rinaldi, Tobias Stollenwerk
2019	J	`jnl`	A mixed integer linear programming model for multi-satellite scheduling. Eur. J. Oper. Res. Xiaoyu Chen, Gerhard Reinelt, Guangming Dai, Andreas Spitz
2019	J	`jnl`	Performance of a Quantum Annealer for Ising Ground State Computations on Chimera Graphs. CoRR Michael Jünger, Elisabeth Lobe, Petra Mutzel, Gerhard Reinelt, Franz Rendl, Giovanni Rinaldi, Tobias Stollenwerk
2018	J	`jnl`	A Mixed Integer Linear Programming Model for Multi-Satellite Scheduling. CoRR Xiaoyu Chen, Gerhard Reinelt, Guangming Dai, Andreas Spitz
2018	J	`jnl`	A Semi-Analytical Method for Periodic Earth Coverage Satellites Optimization. IEEE Commun. Lett. Xiaoyu Chen, Guangming Dai, Gerhard Reinelt, Maocai Wang
2018	J	`jnl`	Discrete Potts Model for Generating Superpixels on Noisy Images. CoRR Ruobing Shen, Xiaoyu Chen, Xiangrui Zheng, Gerhard Reinelt
2018	J	`jnl`	Priority-based and conflict-avoidance heuristics for multi-satellite scheduling. Appl. Soft Comput. Xiaoyu Chen, Gerhard Reinelt, Guangming Dai, Maocai Wang
2017	—	`conf`	A First Derivative Potts Model for Segmentation and Denoising Using ILP. OR Ruobing Shen, Gerhard Reinelt, Stéphane Canu
2017	J	`jnl`	A First Derivative Potts Model for Segmentation and Denoising Using MILP. CoRR Ruobing Shen, Gerhard Reinelt, Stéphane Canu
2017	J	`jnl`	An ILP Solver for Multi-label MRFS with Connectivity Constraints. CoRR Ruobing Shen, Eric Kendinibilir, Ismail Ben Ayed, Andrea Lodi, Andrea Tramontani, Gerhard Reinelt
2016	J	`jnl`	Higher-order segmentation via multicuts. Comput. Vis. Image Underst. Jörg Hendrik Kappes, Markus Speth, Gerhard Reinelt, Christoph Schnörr
2016	J	`jnl`	Symmetry-free SDP Relaxations for Affine Subspace Clustering. CoRR Francesco Silvestri, Gerhard Reinelt, Christoph Schnörr
2015	—	`conf`	A Convex Relaxation Approach to the Affine Subspace Clustering Problem. GCPR Francesco Silvestri, Gerhard Reinelt, Christoph Schnörr
2015	J	`jnl`	Evaluating the quality of image matrices in blockmodeling. EURO J. Comput. Optim. Stefan Wiesberg, Gerhard Reinelt
2015	J	`jnl`	Inter Programming Models for the Target Visitation Problem. Informatica (Slovenia) Achim Hildenbrandt, Gerhard Reinelt
2015	J	`jnl`	PANDA: a software for polyhedral transformations. EURO J. Comput. Optim. Stefan Lörwald, Gerhard Reinelt
2015	J	`jnl`	Relaxations in Practical Clustering and Blockmodeling. Informatica (Slovenia) Stefan Wiesberg, Gerhard Reinelt
2015	J	`jnl`	The Lagrangian relaxation for the combinatorial integral approximation problem. Optim. Methods Softw. Michael N. Jung, Gerhard Reinelt, Sebastian Sager
2014	J	`jnl`	A branch-and-bound algorithm for the coupled task problem. Math. Methods Oper. Res. József Békési, Gábor Galambos, Michael N. Jung, Marcus Oswald, Gerhard Reinelt
2014	J	`jnl`	Lifting and separation procedures for the cut polytope. Math. Program. Thorsten Bonato, Michael Jünger, Gerhard Reinelt, Giovanni Rinaldi
2014	J	`jnl`	Network topology-based detection of differential gene regulation and regulatory switches in cell metabolism and signaling. BMC Syst. Biol. Rosario M. Piro, Stefan Wiesberg, Gunnar Schramm, Nico Rebel, Marcus Oswald, Roland Eils, Gerhard Reinelt, Rainer König
2014	J	`jnl`	On-line bin packing with restricted repacking. J. Comb. Optim. János Balogh, József Békési, Gábor Galambos, Gerhard Reinelt
2013	J	`jnl`	A Flow Formulation for the Optimum Communication Spanning Tree. Electron. Notes Discret. Math. Elena Fernández, Carlos Luna-Mota, Achim Hildenbrandt, Gerhard Reinelt, Stefan Wiesberg
2013	J	`jnl`	Higher-order Segmentation via Multicuts CoRR Jörg Hendrik Kappes, Markus Speth, Gerhard Reinelt, Christoph Schnörr
2013	A*	`conf`	Towards Efficient and Exact MAP-Inference for Large Scale Discrete Computer Vision Problems via Combinatorial Optimization. CVPR Jörg Hendrik Kappes, Markus Speth, Gerhard Reinelt, Christoph Schnörr
2012	J	`jnl`	A benchmark library and a comparison of heuristic methods for the linear ordering problem. Comput. Optim. Appl. Rafael Martí, Gerhard Reinelt, Abraham Duarte
2012	J	`jnl`	A tutorial on branch and cut algorithms for the maximum stable set problem. Int. Trans. Oper. Res. Steffen Rebennack, Gerhard Reinelt, Panos M. Pardalos
2012	J	`jnl`	Exact solution of the 2-dimensional grid arrangement problem. Discret. Optim. Marcus Oswald, Gerhard Reinelt, Stefan Wiesberg
2012	J	`jnl`	New results on the Windy Postman Problem. Math. Program. Angel Corberán, Marcus Oswald, Isaac Plana, Gerhard Reinelt, José M. Sanchis
2011	J	`jnl`	A Branch and Cut solver for the maximum stable set problem. J. Comb. Optim. Steffen Rebennack, Marcus Oswald, Dirk Oliver Theis, Hanna Seitz, Gerhard Reinelt, Panos M. Pardalos
2011	J	`jnl`	A model, a heuristic and a decision support system to solve the scheduling problem of an earth observing satellite constellation. Comput. Ind. Eng. Pei Wang, Gerhard Reinelt, Peng Gao, Yuejin Tan
2011	—	`conf`	Globally Optimal Image Partitioning by Multicuts. EMMCVPR Jörg H. Kappes, Markus Speth, Björn Andres, Gerhard Reinelt, Christoph Schnörr
2011	J	`jnl`	Optimal linear arrangements using betweenness variables. Math. Program. Comput. Alberto Caprara, Marcus Oswald, Gerhard Reinelt, Robert Schwarz, Emiliano Traversi
2010	—	`book`	50 Years of Integer Programming 1958-2008 - From the Early Years to the State-of-the-Art Michael Jünger, Thomas M. Liebling, Denis Naddef, George L. Nemhauser, William R. Pulleyblank, Gerhard Reinelt, Giovanni Rinaldi, Laurence A. Wolsey
2010	J	`jnl`	A Heuristic for an Earth Observing Satellite Constellation Scheduling Problem with Download Considerations. Electron. Notes Discret. Math. Pei Wang, Gerhard Reinelt
2010	J	`jnl`	Generating partitions of a graph into a fixed number of minimum weight cuts. Discret. Optim. Gerhard Reinelt, Klaus Michael Wenger
2010	J	`jnl`	PathWave: discovering patterns of differentially regulated enzymes in metabolic pathways. Bioinform. Gunnar Schramm, Stefan Wiesberg, Nicolle Diessl, Anna-Lena Kranz, Vitalia Sagulenko, Marcus Oswald, Gerhard Reinelt, Frank Westermann, Roland Eils, Rainer König
2010	—	`conf`	Solving the Earth Observing Satellite Constellation Scheduling Problem by Branch-and-Price. OR Pei Wang, Gerhard Reinelt
2010	J	`jnl`	Traces of the XII Aussois Workshop on Combinatorial Optimization. Math. Program. Michael Jünger, Thomas M. Liebling, Denis Naddef, William R. Pulleyblank, Gerhard Reinelt, Giovanni Rinaldi, Laurence A. Wolsey
2009	—	`conf`	Analyzing the regulation of metabolic pathways in human breast cancer. LWA Eva-Maria Surmann, Gunnar Schramm, Stefan Wiesberg, Marcus Oswald, Gerhard Reinelt, Roland Eils, Rainer König
2009	J	`jnl`	Direct methods with maximal lower bound for mixed-integer optimal control problems. Math. Program. Sebastian Sager, Hans Georg Bock, Gerhard Reinelt
2009	J	`jnl`	Improved analysis of an algorithm for the coupled task problem with UET jobs. Oper. Res. Lett. József Békési, Gábor Galambos, Marcus Oswald, Gerhard Reinelt
2009	J	`jnl`	Reconstructing nonlinear dynamic models of gene regulation using stochastic sampling. BMC Bioinform. Johanna Mazur, Daniel Ritter, Gerhard Reinelt, Lars Kaderali
2009	J	`jnl`	The simultaneous consecutive ones problem. Theor. Comput. Sci. Marcus Oswald, Gerhard Reinelt
2008	J	`jnl`	Computing finest mincut partitions of a graph and application to routing problems. Discret. Appl. Math. Gerhard Reinelt, Dirk Oliver Theis, Klaus Michael Wenger
2008	J	`jnl`	Lower Bound for the Online Bin Packing Problem with Restricted Repacking. SIAM J. Comput. János Balogh, József Békési, Gábor Galambos, Gerhard Reinelt
2008	J	`jnl`	Odd Minimum Cut Sets and b-Matchings Revisited. SIAM J. Discret. Math. Adam N. Letchford, Gerhard Reinelt, Dirk Oliver Theis
2008	J	`jnl`	On the general routing polytope. Discret. Appl. Math. Gerhard Reinelt, Dirk Oliver Theis
2007	B	`conf`	Compression of Digital Road Networks. SSTD Jonghyun Suh, Sungwon Jung, Martin Pfeifle, Khoa T. Vo, Marcus Oswald, Gerhard Reinelt
2007	J	`jnl`	On the graphical relaxation of the symmetric traveling salesman polytope. Math. Program. Marcus Oswald, Gerhard Reinelt, Dirk Oliver Theis
2007	—	`conf`	Optimizing in Graphs with Expensive Computation of Edge Weights. OR Frank Noé, Marcus Oswald, Gerhard Reinelt
2006	J	`jnl`	A note on the Undirected Rural Postman Problem polytope. Math. Program. Gerhard Reinelt, Dirk Oliver Theis
2006	J	`jnl`	A tabu search algorithm for the min-max Comput. Oper. Res. Dino Ahr, Gerhard Reinelt
2006	J	`jnl`	Computing Best Transition Pathways in High-Dimensional Dynamical Systems: Application to the Multiscale Model. Simul. Frank Noé, Marcus Oswald, Gerhard Reinelt, Stefan Fischer, Jeremy C. Smith
2006	J	`jnl`	Discovering functional gene expression patterns in the metabolic network of BMC Bioinform. Rainer König, Gunnar Schramm, Marcus Oswald, Hanna Seitz, Sebastian Sager, Marc Zapatka, Gerhard Reinelt, Roland Eils
2006	J	`jnl`	Maximally Violated Mod- INFORMS J. Comput. Gerhard Reinelt, Klaus Michael Wenger
2006	—	`conf`	Pattern recognition of gene expression data on biochemical networks with simple wavelet transforms. LWA Gunnar Schramm, Marcus Oswald, Hanna Seitz, Sebastian Sager, Marc Zapatka, Gerhard Reinelt, Roland Eils, Rainer König
2006	Misc	`conf`	Solving City Bus Scheduling Problems in Bangkok by Eligen-Algorithm. HPSC Chotiros Surapholchai, Gerhard Reinelt, Hans Georg Bock
2005	—	`conf`	Locating Health Facilities in Nouna District, Burkina Faso. OR Cara Cocking, Steffen Flessa, Gerhard Reinelt
2005	B	`conf`	Not Every GTSP Facet Induces an STSP Facet. IPCO Marcus Oswald, Gerhard Reinelt, Dirk Oliver Theis
2005	J	`jnl`	Transformation of Facets of the General Routing Problem Polytope. SIAM J. Optim. Gerhard Reinelt, Dirk Oliver Theis
2004	B	`conf`	A Faster Exact Separation Algorithm for Blossom Inequalities. IPCO Adam N. Letchford, Gerhard Reinelt, Dirk Oliver Theis
2004	J	`jnl`	An exact algorithm for scheduling identical coupled tasks. Math. Methods Oper. Res. Dino Ahr, József Békési, Gábor Galambos, Marcus Oswald, Gerhard Reinelt
2004	J	`jnl`	Book review. Oper. Res. Lett. Gerhard Reinelt
2004	—	`ch.`	Computing Optimal Consecutive Ones Matrices. The Sharpest Cut Marcus Oswald, Gerhard Reinelt
2003	Misc	`conf`	Advanced Column Generation Techniques for Crew Pairing Problems. HPSC Tran Van Hoai, Gerhard Reinelt, Hans Georg Bock
2003	—	`ed.`	Combinatorial Optimization - Eureka, You Shrink!, Papers Dedicated to Jack Edmonds, 5th International Workshop, Aussois, France, March 5-9, 2001, Revised Papers Combinatorial Optimization Michael Jünger, Gerhard Reinelt, Giovanni Rinaldi
2003	J	`jnl`	The weighted consecutive ones problem for a fixed number of rows or columns. Oper. Res. Lett. Marcus Oswald, Gerhard Reinelt
2002	A	`conf`	New Heuristics and Lower Bounds for the Min-Max k -Chinese Postman Problem. ESA Dino Ahr, Gerhard Reinelt
2001	J	`jnl`	Algorithmic Aspects of Using Small Instance Relaxations in Parallel Branch-and-Cut. Algorithmica Thomas Christof, Gerhard Reinelt
2001	—	`conf`	Constructing New Facets of the Consecutive Ones Polytope. Combinatorial Optimization Marcus Oswald, Gerhard Reinelt
2001	J	`jnl`	Decomposition and Parallelization Techniques for Enumerating the Facets of Combinatorial Polytopes. Int. J. Comput. Geom. Appl. Thomas Christof, Gerhard Reinelt
2000	J	`jnl`	A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints. Comput. Optim. Appl. Norbert Ascheuer, Michael Jünger, Gerhard Reinelt
2000	Misc	`conf`	Polyhedral Aspects of the Consecutive Ones Problem. COCOON Marcus Oswald, Gerhard Reinelt
1998	B	`conf`	Consecutive Ones and a Betweenness Problem in Computational Biology. IPCO Thomas Christof, Marcus Oswald, Gerhard Reinelt
1997	J	`jnl`	A Branch-and-Cut Approach to Physical Mapping of Chromosomes by Unique End-Probes. J. Comput. Biol. Thomas Christof, Michael Jünger, John D. Kececioglu, Petra Mutzel, Gerhard Reinelt
1997	B	`conf`	A branch-and-cut approach to physical mapping with end-probes. RECOMB Thomas Christof, Michael Jünger, John D. Kececioglu, Petra Mutzel, Gerhard Reinelt
1996	B	`conf`	A Polyhedral Approach to the Feedback Vertex Set Problem. IPCO Meinrad Funke, Gerhard Reinelt
1994	J	`jnl`	Provably good solutions for the traveling salesman problem. Math. Methods Oper. Res. Michael Jünger, Stefan Thienel, Gerhard Reinelt
1994	J	`jnl`	Quadratic 0/1 optimization and a decomposition approach for the placement of electronic circuits. Math. Program. Michael Jünger, Alexander Martin, Gerhard Reinelt, Robert Weismantel
1994	—	`book`	The Traveling Salesman, Computational Solutions for TSP Applications Gerhard Reinelt
1993	J	`jnl`	A Note on Small Linear-Ordering Polytopes. Discret. Comput. Geom. Gerhard Reinelt
1993	J	`jnl`	Book review. ZOR Methods Model. Oper. Res. Gerhard Reinelt
1993	J	`jnl`	Book reviews. ZOR Methods Model. Oper. Res. M. Bischoff, Norbert Gaffke, K. Fleischmann, Gerhard Reinelt
1993	—	`conf`	Practical problem solving with cutting plane algorithms in combinatorialoptimization. Combinatorial Optimization Michael Jünger, Gerhard Reinelt, Stefan Thienel
1992	J	`jnl`	Fast Heuristics for Large Geometric Traveling Salesman Problems. INFORMS J. Comput. Gerhard Reinelt
1991	J	`jnl`	A complete description of the traveling salesman polytope on 8 nodes. Oper. Res. Lett. Thomas Christof, Michael Jünger, Gerhard Reinelt
1991	J	`jnl`	Computing correct Delaunay triangulations. Computing Michael Jünger, Gerhard Reinelt, Doris Zepf
1991	J	`jnl`	Optimal control of plotting and drilling machines: A case study. ZOR Methods Model. Oper. Res. Martin Grötschel, Michael Jünger, Gerhard Reinelt
1991	J	`jnl`	TSPLIB - A Traveling Salesman Problem Library. INFORMS J. Comput. Gerhard Reinelt
1990	—	`conf`	Computing the Convex Hull in the Euclidean Plane in Linear Expected Time. Applied Geometry And Discrete Mathematics Karl Heinz Borgwardt, Norbert Gaffke, Michael Jünger, Gerhard Reinelt
1990	—	`conf`	Polyedrische Methoden zur Lösung großer kombinatorischer Optimierungsprobleme. GI Jahrestagung (2) Gerhard Reinelt
1989	J	`jnl`	Experiments in quadratic 0-1 programming. Math. Program. Francisco Barahona, Michael Jünger, Gerhard Reinelt
1988	J	`jnl`	An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design. Oper. Res. Francisco Barahona, Martin Grötschel, Michael Jünger, Gerhard Reinelt
1987	J	`jnl`	Generalizations of Cliques, Odd Cycles and Anticycles and Their Relation to Independence System Polyhedra. Math. Oper. Res. Reinhardt Euler, Michael Jünger, Gerhard Reinelt
1985	J	`jnl`	Facets of the linear ordering polytope. Math. Program. Martin Grötschel, Michael Jünger, Gerhard Reinelt
1985	J	`jnl`	On partitioning the edges of graphs into connected subgraphs. J. Graph Theory Michael Jünger, Gerhard Reinelt, William R. Pulleyblank
1985	J	`jnl`	On the acyclic subgraph polytope. Math. Program. Martin Grötschel, Michael Jünger, Gerhard Reinelt
1985	—	`—`	The linear ordering problem: algorithms and applications. Gerhard Reinelt
1984	J	`jnl`	A Cutting Plane Algorithm for the Linear Ordering Problem. Oper. Res. Martin Grötschel, Michael Jünger, Gerhard Reinelt