scientific article; zbMATH DE number 7525500

DOI10.4230/LIPICS.ESA.2019.63MaRDI QIDQ5075808zbMATH OpenFDO

Authors Michael Jünger, Sven Mallach

Publication date 11 May 2022

Full work available at URL https://doi.org/10.4230/LIPICS.ESA.2019.63

zbMATH Keywords

binary quadratic optimizationinteger linear programmingmaximum cut

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Exact Facetial Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization
• Chvátal Cuts and Odd Cycle Inequalities in Quadratic 0–1 Optimization
• A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs
• The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
• Decomposition and optimization over cycles in binary matroids
• scientific article; zbMATH DE number 4070666
• Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization
• Approximation algorithms for max cut and max bisection problems using semidefinite programming relaxations
• On disjunctive cuts for combinatorial optimization
• New quadratic models for the maximum weighted cut problem

Cited in

(5)

• Exact Facetial Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization
• Faster exact solution of sparse maxcut and QUBO problems
• Simple odd -cycle inequalities for binary polynomial optimization
• A family of spanning-tree formulations for the maximum cut problem
• Facet-defining triangle inequalities for the quadratic linear ordering problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5075808)