Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition (Q2583135): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: DBLP publication ID (P1635): journals/mp/FischerGRS06, #quickstatements; #temporary_batch_1731543907597
 
(5 intermediate revisions by 5 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q59196591 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CirCut / 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-005-0661-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2085647652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for convex programming that uses analytic centers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The volume algorithm revisited: relation with bundle methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A restricted Lagrangean approach to the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The volume algorithm: Producing primal solutions with a subgradient method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiments in quadratic 0-1 programming / 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: Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs / 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: Lower Bounds for the Partitioning of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Bundle Methods / 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: Decomposition and Nondifferentiable Optimization with the Projective Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling-Salesman Problem and Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840376 / 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: Q4400639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods of descent for nondifferentiable optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4182272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The omnipresence of Lagrange / rank
 
Normal rank
Property / cites work
 
Property / cites work: New variants of bundle methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph partitioning using linear and semidefinite programming / 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: Strengthening the Lovász \(\theta(\overline G)\) bound for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity estimates of some cutting plane methods based on the analytic barrier / 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: Nonpolyhedral Relaxations of Graph-Bisection Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5566712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for the quadratic assignment problem using the bundle method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study of search directions in primal-dual interior-point methods for semidefinite programming / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/mp/FischerGRS06 / rank
 
Normal rank

Latest revision as of 01:49, 14 November 2024

scientific article
Language Label Description Also known as
English
Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition
scientific article

    Statements

    Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 January 2006
    0 references
    Bundle method
    0 references
    Semidefinite Programming
    0 references
    Max-Cut
    0 references
    Equipartition
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers