Improved semidefinite bounding procedure for solving max-cut problems to optimality (Q2436651): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: BOB / 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-0594-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2069154666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LAPACK Users' Guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook on semidefinite, conic and polynomial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Semidefinite, Conic and Polynomial 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: Numerical optimization. Theoretical and practical aspects. Transl. from the French / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis and nonlinear optimization. Theory and examples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Limited Memory Algorithm for Bound Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reflections on generating (disjunctive) cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / 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: Q5689624 / 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: Q3141900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gap inequalities for the cut polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The spherical constraint in Boolean quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving \(k\)-cluster problems to optimality with semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remark on “algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound constrained optimization” / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Approaches to Max-Cut / 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: Quadratic programming with one negative eigenvalue is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 778: L-BFGS-B / rank
 
Normal rank

Latest revision as of 10:16, 7 July 2024

scientific article
Language Label Description Also known as
English
Improved semidefinite bounding procedure for solving max-cut problems to optimality
scientific article

    Statements

    Improved semidefinite bounding procedure for solving max-cut problems to optimality (English)
    0 references
    0 references
    0 references
    0 references
    25 February 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    combinatorial optimization
    0 references
    semidefinite programming
    0 references
    quasi-Newton algorithm
    0 references
    triangle inequalities
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references