Speeding up IP-based algorithms for constrained quadratic 0-1 optimization (Q2638389): Difference between revisions

From MaRDI portal
Added link to MaRDI 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: QAPLIB / 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-010-0377-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2073457547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4735941 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cut polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local cuts revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3181648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Algorithms for the Quadratic Linear Ordering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: QAPLIB - a quadratic assignment problem library / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained 0-1 quadratic programming: basic approaches and extensions / 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: Geometry of cuts and metrics / 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: Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A semidefinite programming approach to the quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4668573 / 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 05:50, 3 July 2024

scientific article
Language Label Description Also known as
English
Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
scientific article

    Statements

    Speeding up IP-based algorithms for constrained quadratic 0-1 optimization (English)
    0 references
    0 references
    0 references
    0 references
    16 September 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    quadratic programming
    0 references
    maximum-cut problem
    0 references
    local cuts
    0 references
    quadratic knapsack
    0 references
    crossing minimization
    0 references
    similar subgraphs
    0 references
    0 references