Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation (Q2307500): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q126411960, #quickstatements; #temporary_batch_1718133921243
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design / 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: An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using a Mixed Integer Programming Tool for Solving the 0–1 Quadratic Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A penalized Fischer-Burmeister NCP-function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A continuation approach for solving binary quadratic program based on a class of NCP-functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized heuristics for the Max-Cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxation for nonconvex quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Implementations for Nonsmooth Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Quality of Spectral Separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5613011 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Spectral Bundle Method for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On clusterings / rank
 
Normal rank
Property / cites work
 
Property / cites work: An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for nonlinear optimization problems with binary variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: A low complexity semidefinite relaxation for large-scale MIMO detection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved row-by-row method for binary quadratic optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global continuation algorithm for solving binary quadratic programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5494211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Optimization Algorithms for Structural Reliability Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3802887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SDPT3 — A Matlab software package for semidefinite programming, Version 1.3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving semidefinite-quadratic-linear programs using SDPT3 / rank
 
Normal rank

Revision as of 02:45, 22 July 2024

scientific article
Language Label Description Also known as
English
Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation
scientific article

    Statements

    Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation (English)
    0 references
    0 references
    0 references
    24 March 2020
    0 references
    binary quadratic programming problem
    0 references
    continuous relaxation
    0 references
    augmented Lagrangian method
    0 references
    max-cut problems
    0 references
    QKP
    0 references
    image deconvolution
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers