Lagrangean methods for 0-1 quadratic problems
From MaRDI portal
Publication:1803678
DOI10.1016/0166-218X(93)90049-TzbMATH Open0780.90068MaRDI QIDQ1803678FDOQ1803678
Authors: Philippe Michelon, Nelson Maculan 
Publication date: 29 June 1993
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
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
- Title not available (Why is that?)
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Title not available (Why is that?)
- Title not available (Why is that?)
- Minimum cuts and related problems
- Methods of Nonlinear 0-1 Programming
- Lagrangean decomposition for integer nonlinear programming with linear constraints
- Problème de la bipartition minimale d'un graphe
Cited In (13)
- A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs
- A Decomposition Method for Quadratic Zero-One Programming
- Dualité lagrangienne en programmation fractionnaire concave-convexe en variables 0–1
- Lagrangian decomposition of block-separable mixed-integer all-quadratic programs
- 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
- An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating
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)
