A

Anjos, Miguel and Liers, Frauke (2011) Global Approaches for Facility Layout and VLSI Floorplanning.
Published in: Handbook on Semidefinite, Conic and Polynomial Optimization., International Series in Operations Research & Management Science. Springer 2011.

B

Barahona, Francisco and Jünger, Michael and Reinelt, Gerhard (1989) Experiments in Quadratic 0–1 Programming.
Published in: Mathematical Programming Vol. 44 (1-3). pp. 127-137. ISSN 0025-5610

Baumann, Frank and Buchheim, Christoph and Liers, Frauke (2010) Exact Bipartite Crossing Minimization under Tree Constraints.
Published In: 9th International Symposium on Experimental Algorithms SEA 2010, Lecture Notes in Computer Science. 6049 Springer Verlag 2010, pp. 118-128.

Buchheim, Christoph and Caprara, Alberto and Lodi, Andrea (2010) An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming.
Published In: Integer programming and combinatorial optimization : 14th international conference, IPCO 2010, Lausanne, Switzerland, June 9 - 11, 2010 ; proceedings, Lecture notes in computer science. 6080 Springer 2010, pp. 285-298.

Buchheim, Christoph and Liers, Frauke and Oswald, Marcus (2008) A Basic Toolbox for Constrained Quadratic 0/1 Optimization.
Published In: Experimental algorithms 7th international workshop, WEA 2008, Provincetown, MA, USA, May 30 - June 1, 2008 ; proceedings, Lecture Notes in Computer Science. 5038 Springer 2008, pp. 249-262.

Buchheim, Christoph and Liers, Frauke and Oswald, Marcus (2010) Speeding up IP-based Algorithms for Constrained Quadratic 0-1 Optimization.
Published in: Mathematical Programming B Vol. 124 (1-2). pp. 513-535.

Buchheim, Christoph and Wiegele, Angelika and Zheng, Lanbo (2007) Exact Algorithms for the Quadratic Linear Ordering Problem.
Published in: INFORMS Journal on Computing Vol. 22 (1). pp. 168-177.

C

Charfreitag, Jonas and Jünger, Michael and Mallach, Sven and Mutzel, Petra (2022) McSparse: Exact Solutions of Sparse Maximum Cut and Sparse Unconstrained Binary Quadratic Optimization Problems.

G

Ghaddar, Bissan and Anjos, Miguel and Liers, Frauke (2007) A Branch-and-Cut Algorithm based on Semidefinite Programming for the Minimum k-Partition Problem.
Published in: Annals of Operations Research Vol. 188 (1). pp. 155-174.

J

Jünger, Michael and Mallach, Sven (2020) Exact Facetial Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization.
Published in: Informs Journal on Computing.

Jünger, Michael and Mallach, Sven (2019) Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization.
Published In: 27th Annual European Symposium on Algorithms (ESA 2019), Lipics. Dagstuhl Publishing 6 September 2019, 63:1-63:13.

M

Mallach, Sven (2018) Compact Linearization for Binary Quadratic Problems Comprising Linear Constraints.
Technical Report , 16 p.

Mallach, Sven (2017) Compact Linearization for Binary Quadratic Problems subject to Linear Equations.
Technical Report , 10 p.

Mallach, Sven (2017) Compact linearization for binary quadratic problems subject to assignment constraints.
Published in: 4OR : Quarterly Journal of Operations Research. pp. 1-14. ISSN 1614-2411

Mallach, Sven (2021) Inductive Linearization for Binary Quadratic Programs with Linear Constraints: A Computational Study.
Technical Report Springer, 30 p.

Mallach, Sven (2020) Inductive linearization for binary quadratic programs with linear constraints.
Published in: 4OR : Quarterly Journal of Operations Research. pp. 1-23.

Z

Zheng, Lanbo and Buchheim, Christoph (2007) A New Exact Algorithm for the Two-Sided Crossing Minimization Problem.
Published In: Combinatorial optimization and applications first international conference, COCOA 2007, Xi'an, China, August 14-16, 2007 ; proceedings, Lecture Notes in Computer Science. 4616 Springer 2007, pp. 301-310.