Lagrangean methods for 0-1 quadratic problems
From MaRDI portal
(Redirected from Publication:1803678)
Recommendations
- Lagrangean methods for the 0-1 quadratic knapsack problem
- Decomposition and linearization for 0-1 quadratic programming
- An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
- A Decomposition Method for Quadratic Zero-One Programming
- A new upper bound for the 0-1 quadratic knapsack problem
Cites work
- scientific article; zbMATH DE number 3748742 (Why is no real title available?)
- scientific article; zbMATH DE number 3783030 (Why is no real title available?)
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- Lagrangean decomposition for integer nonlinear programming with linear constraints
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Methods of Nonlinear 0-1 Programming
- Minimum cuts and related problems
- Problème de la bipartition minimale d'un graphe
Cited in
(13)- An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating
- A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs
- A Decomposition Method for Quadratic Zero-One Programming
- Lagrangian decomposition of block-separable mixed-integer all-quadratic programs
- Dualité lagrangienne en programmation fractionnaire concave-convexe en variables 0–1
- Decomposition and linearization for 0-1 quadratic programming
- A nonlinear Lagrangian dual for integer programming
- Classroom Note: The Lagrange--Charpit Method
- Lagrangean decompositions for the unconstrained binary quadratic programming problem
- Lagrangean methods for the 0-1 quadratic knapsack problem
- Linear programming for the \(0-1\) quadratic knapsack problem
- Reoptimization in Lagrangian methods for the 0-1 quadratic knapsack problem
- Towards strong duality in integer programming
This page was built for publication: Lagrangean methods for 0-1 quadratic problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1803678)