Solving quadratic (0,1)-problems by semidefinite programs and cutting planes (Q1290621): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The max-cut problem on graphs not contractible to \(K_ 5\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiments in quadratic 0-1 programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chvátal Cuts and Odd Cycle Inequalities in Quadratic 0–1 Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds / 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: The indefinite zero-one quadratic problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial properties and the complexity of a max-cut approximation / 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: The cut polytope and the Boolean quadric polytope / 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: The hypermetric cone is polyhedral / rank
 
Normal rank
Property / cites work
 
Property / cites work: Application of cut polyhedra. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of cut polyhedra. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry of cuts and metrics / 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: Some Network Flow Problems Solved with Pseudo-Boolean Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Roof duality, complementation and persistency in quadratic 0–1 optimization / 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: An algorithm for quadratic zero-one programs / 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: On the Facial Structure of the Set of Correlation Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connection between semidefinite relaxations of the max-cut and stable set problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5202209 / 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: The expected relative error of the polyhedral approximation of the max- cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4840774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node and edge relaxations of the max-cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonpolyhedral Relaxations of Graph-Bisection Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the max-cut problem using eigenvalues / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01580072 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2078979423 / rank
 
Normal rank

Latest revision as of 10:39, 30 July 2024

scientific article
Language Label Description Also known as
English
Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
scientific article

    Statements

    Solving quadratic (0,1)-problems by semidefinite programs and cutting planes (English)
    0 references
    0 references
    0 references
    3 June 1999
    0 references
    quadratic (0,1)-programming
    0 references
    max-cut problem
    0 references
    semidefinite program
    0 references
    branch-and-bound
    0 references
    0 references
    0 references
    0 references

    Identifiers