Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (Q847837): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q240162
ReferenceBot (talk | contribs)
Changed an Item
 
(8 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Franz Rendl / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ABACUS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CirCut / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SCIP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: OR-Library / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: COL / 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-008-0235-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2033498477 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SCIP: solving constraint integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching rules revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut / 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: Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs / 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: Laplacian eigenvalues and the maximum cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry of cuts and metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4735939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition / rank
 
Normal rank
Property / cites work
 
Property / cites work: New approaches for optimizing over the semimetric polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive Memory Tabu Search for Binary Quadratic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: .879-approximation algorithms for MAX CUT and MAX 2SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods of Nonlinear 0-1 Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixing Variables in Semidefinite Relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5465120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving quadratic (0,1)-problems by semidefinite programs and cutting planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Interior-Point Method for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning / 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: Q4400639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Second order cone programming relaxation of nonconvex quadratic optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398372 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4668573 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A NEW SECOND-ORDER CONE PROGRAMMING RELAXATION FOR MAX-CUT PROBLEMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational aspects of a branch and bound algorithm for quadratic zero- one programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the max-cut problem using eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonpolyhedral Relaxations of Graph-Bisection Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming and combinatorial optimization / 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:05, 2 July 2024

scientific article
Language Label Description Also known as
English
Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
scientific article

    Statements

    Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (English)
    0 references
    0 references
    0 references
    0 references
    19 February 2010
    0 references
    cut polytope
    0 references
    unconstrained binary quadratic optimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers