Generalised 2-circulant inequalities for the max-cut problem (Q2670485): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.orl.2022.01.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4206705411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur les inégalités valides dans \(L^ 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lift-and-project cutting plane algorithm for mixed 0-1 programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiments in quadratic 0-1 programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cut polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifting and separation procedures for the cut polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collapsing and lifting for the cut cone / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets for the cut cone. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry of cuts and metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fibonacci heaps and their uses in improved network optimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing the Odd Bicycle Wheel Inequalities for the Bipartite Subgraph Polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the 2-circulant inequalities for the MAX-cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398372 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a positive semidefinite relaxation of the cut polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gap inequalities for the cut polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: On disjunctive cuts for combinatorial optimization / 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: Computational Approaches to Max-Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max-cut in circulant graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations / rank
 
Normal rank

Latest revision as of 07:19, 28 July 2024

scientific article
Language Label Description Also known as
English
Generalised 2-circulant inequalities for the max-cut problem
scientific article

    Statements

    Generalised 2-circulant inequalities for the max-cut problem (English)
    0 references
    0 references
    0 references
    0 references
    11 March 2022
    0 references
    0 references
    max-cut problem
    0 references
    polyhedral combinatorics
    0 references
    cutting planes
    0 references
    0 references