Decomposition and linearization for 0-1 quadratic programming
From MaRDI portal
Recommendations
Cited in
(20)- A linearization framework for unconstrained quadratic (0-1) problems
- Lagrangean methods for the 0-1 quadratic knapsack problem
- Lagrangean methods for 0-1 quadratic problems
- A new upper bound for the 0-1 quadratic knapsack problem
- Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic 0-1 optimization problems with linear constraints
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- An improved linearization strategy for zero-one quadratic programming problems
- Graph separation techniques for quadratic zero-one programming
- On the Quadratic Programming Approach for Hub Location Problems
- A column generation approach for the unconstrained binary quadratic programming problem
- scientific article; zbMATH DE number 1500161 (Why is no real title available?)
- scientific article; zbMATH DE number 1501879 (Why is no real title available?)
- A Decomposition Method for Quadratic Zero-One Programming
- Mathematical programming models and exact algorithms
- Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1
- A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs
- An improved linearization technique for a class of quadratic 0-1 programming problems
- Block linear majorants in quadratic 0--1 optimization
- Continuity of the optimal value function and optimal solutions of parametric mixed-integer quadratic programs
- A network approach for specially structured linear programs arising in 0-1 quadratic optimization
This page was built for publication: Decomposition and linearization for 0-1 quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5933830)
