Strong lift-and-project cutting planes for the stable set problem (Q378110): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(5 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Concorde / rank
 
Normal rank
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.1007/s10107-012-0513-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2090669908 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425132 / 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: Q5687247 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning procedures for solving mixed-variables programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Lift-and-Project Relaxations of Binary Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wheel inequalities for stable set polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antiweb-wheel inequalities and their separation problems over the stable set polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid inequalities for mixed integer linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxations for graph coloring and maximal clique problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the selection of Benders' cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring the relationship between max-cut and stable set relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Approach to the Stable Set Problem Based on Ellipsoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong lift-and-project cutting planes for the stable set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Experience with Stable Set Relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique is hard to approximate within \(n^{1-\epsilon}\) / 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: Q4714131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymptotic behaviour of Lovasz' \(\vartheta\) function for random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Shannon capacity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cones of Matrices and Set-Functions and 0–1 Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the maximum stable set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687256 / 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: On the facial structure of set packing polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: A boundary point method to solve semidefinite programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and cut solver for the maximum stable set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for the maximum cardinality stable set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of facet producing graphs for vertex packing polyhedra / rank
 
Normal rank

Revision as of 00:37, 7 July 2024

scientific article
Language Label Description Also known as
English
Strong lift-and-project cutting planes for the stable set problem
scientific article

    Statements

    Strong lift-and-project cutting planes for the stable set problem (English)
    0 references
    0 references
    0 references
    0 references
    11 November 2013
    0 references
    stable set problem
    0 references
    cutting planes
    0 references
    Lovász and Schrijver lift-and-project operators
    0 references
    Benders decomposition
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers