Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method (Q1025986): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SBmethod / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2146361854 / 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: A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new bound for the quadratic assignment problem based on convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Different Formulations for Solving the Heaviest<i>K</i>-Subgraph Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for a task allocation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best reduction of the quadratic semi-assignment 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: 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: An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for the equicut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Lower Bound for the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The indefinite zero-one quadratic problem / 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: Clustering and domination in perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The basic algorithm for pseudo-Boolean programming revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3747197 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3270229 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5613011 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538300 / 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: A Spectral Bundle Method for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for quadratic zero-one programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Graph Bisection Problems with Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete location problems with push-pull objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997942 / 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 decomposition for integer nonlinear programming with linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds and exact algorithms for \(p\)-dispersion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mathematical View of Interior-Point Methods in Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reformulation-linearization technique for solving discrete and continuous nonconvex problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:29, 1 July 2024

scientific article
Language Label Description Also known as
English
Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
scientific article

    Statements

    Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method (English)
    0 references
    0 references
    0 references
    23 June 2009
    0 references
    quadratic 0-1 programming
    0 references
    convex quadratic programming
    0 references
    semidefinite programming
    0 references
    densest \(k\)-subgraph
    0 references
    graph bisection
    0 references
    task allocation
    0 references
    experiments
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers