An Improved Interior-Point Cutting-Plane Method for Binary Quadratic Optimization (Q2883644): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Biq Mac / 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.1016/j.endm.2010.05.094 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2039616602 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Semidefinite Programming Relaxations of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Study of Indicators for Identifying Zero Variables in Interior-Point Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Interior-Point Warmstarts for Linear and Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Identification of Zero Variables in an Interior-Point Framework / 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: 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: Q4668573 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Experience with an Interior Point Cutting Plane Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomiality of infeasible-interior-point algorithms for linear 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: Handbook of semidefinite programming. Theory, algorithms, and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4254875 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:25, 5 July 2024

scientific article
Language Label Description Also known as
English
An Improved Interior-Point Cutting-Plane Method for Binary Quadratic Optimization
scientific article

    Statements

    An Improved Interior-Point Cutting-Plane Method for Binary Quadratic Optimization (English)
    0 references
    0 references
    0 references
    0 references
    13 May 2012
    0 references
    combinatorial optimization
    0 references
    binary quadratic programs
    0 references
    semidefinite relaxations
    0 references
    interior-point methods
    0 references
    cutting-plane methods
    0 references
    warmstarts
    0 references

    Identifiers