Dantzig-Wolfe reformulations for binary quadratic problems (Q2125570): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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/s12532-021-00206-w / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4205253277 / 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: Combining QCR and CHR for convex quadratic pure 0--1 programming problems with linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Large Zero-One Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random sampling and machine learning to understand good decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic Dantzig-Wolfe reformulation of mixed integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending the QCR method to general mixed-integer programs / 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: Semidefinite relaxations for non-convex quadratic mixed-integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Solution of the Quadratic Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition Principle for Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the solution of the 0-1 knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial Lagrangian relaxation for general quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: L’algebre de Boole et ses applications en recherche operationnelle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Linear Integer Programming Formulations of Nonlinear Integer Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: ``Miniaturized'' linearizations for quadratic 0/1 problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: BiqCrunch / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplicial with truncated Dantzig-Wolfe decomposition for nonlinear multicommodity network flow problems with side constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A geometric study of dual gaps, with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Solution Methods for the k-Item Quadratic Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact linearization for binary quadratic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: GLOMIQO: global mixed-integer quadratic optimizer / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quadratic knapsack problem -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic convex reformulations for quadratic 0-1 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: FiberSCIP—A Shared Memory Parallelization of SCIP / 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 generic view of Dantzig--Wolfe decomposition in mixed integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A duality theorem for non-linear programming / rank
 
Normal rank

Latest revision as of 15:20, 28 July 2024

scientific article
Language Label Description Also known as
English
Dantzig-Wolfe reformulations for binary quadratic problems
scientific article

    Statements

    Dantzig-Wolfe reformulations for binary quadratic problems (English)
    0 references
    0 references
    0 references
    0 references
    14 April 2022
    0 references
    binary quadratic programming
    0 references
    decomposition methods
    0 references
    quadratic convex reformulation
    0 references
    column generation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers