Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem (Q1762145): 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.cor.2011.09.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2024573003 / 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: Computational aspects of a branch and bound algorithm for quadratic zero- one programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of a quadratic pseudo-Boolean function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bound improvement and forcing rule for quadratic binary 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: One-pass heuristics for large-scale unconstrained binary quadratic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multistart tabu search strategies for the unconstrained binary quadratic optimization problem / 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: On the equivalence between roof duality and Lagrangian duality for unconstrained \(0\)-\(1\) quadratic programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear forms of nonlinear expressions: new insights on old ideas / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Decomposition Method for Quadratic Zero-One Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean decompositions for the unconstrained binary quadratic programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive Memory Tabu Search for Binary Quadratic Programs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:08, 5 July 2024

scientific article
Language Label Description Also known as
English
Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem
scientific article

    Statements

    Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem (English)
    0 references
    15 November 2012
    0 references
    column generation
    0 references
    Lagrangian decomposition
    0 references
    quadratic programming
    0 references

    Identifiers