Lagrangean decompositions for the unconstrained binary quadratic programming problem (Q3087848): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming for the \(0-1\) quadratic knapsack problem / 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: A new upper bound for the 0-1 quadratic knapsack problem / 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: Upper-bounds for quadratic 0-1 maximization / 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: Adaptive Memory Tabu Search for Binary Quadratic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program / 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: The traveling-salesman problem and minimum spanning trees: Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-price approach for the maximum weight independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Multilevel series k-Way Partitioning Scheme for Irregular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048590 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic Binary Programming with Application to Capital-Budgeting Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Implicit Enumeration Algorithm for Quadratic Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean/surrogate relaxation for generalized assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global optimization approach for solving the maximum clique 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: Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quadratic assignment formulation of the molecular conformation problem / rank
 
Normal rank

Latest revision as of 10:14, 4 July 2024

scientific article
Language Label Description Also known as
English
Lagrangean decompositions for the unconstrained binary quadratic programming problem
scientific article

    Statements

    Lagrangean decompositions for the unconstrained binary quadratic programming problem (English)
    0 references
    17 August 2011
    0 references
    quadratic programming
    0 references
    Lagrangian decomposition
    0 references
    bounds
    0 references
    0 references

    Identifiers