Lagrangean methods for 0-1 quadratic problems
From MaRDI portal
Publication:1803678
DOI10.1016/0166-218X(93)90049-TzbMath0780.90068MaRDI QIDQ1803678
Philippe Yves Paul Michelon, Nelson F. Maculan
Publication date: 29 June 1993
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items
An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating, Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem, Towards strong duality in integer programming, Linear programming for the \(0-1\) quadratic knapsack problem, Lagrangean methods for the 0-1 quadratic knapsack problem, A nonlinear Lagrangian dual for integer programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lagrangean decomposition for integer nonlinear programming with linear constraints
- Problème de la bipartition minimale d'un graphe
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Methods of Nonlinear 0-1 Programming
- Minimum cuts and related problems