Exact Facetial Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization (Q5084606): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1287/ijoc.2020.1008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3132970834 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cut polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiments in quadratic 0-1 programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chvátal Cuts and Odd Cycle Inequalities in Quadratic 0–1 Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cut polytope and the Boolean quadric polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact ground states of two-dimensional \(\pm J\) Ising spin glasses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weakly bipartite graphs and the max-cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Network Flow Problems Solved with Pseudo-Boolean Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Airline Crew Scheduling Problems by Branch-and-Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5075808 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for minimum weight odd circuits and cuts in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new separation algorithm for the Boolean quadric and cut polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Crown Inequalities for the Symmetric Traveling Salesman Polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Boolean quadratic polytope: Some characteristics, facets and relatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations / rank
 
Normal rank

Latest revision as of 11:12, 29 July 2024

scientific article; zbMATH DE number 7549342
Language Label Description Also known as
English
Exact Facetial Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization
scientific article; zbMATH DE number 7549342

    Statements

    Exact Facetial Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization (English)
    0 references
    0 references
    0 references
    28 June 2022
    0 references
    maximum cut
    0 references
    binary quadratic optimization
    0 references
    integer linear programming
    0 references

    Identifiers