Lagrangean methods for 0-1 quadratic problems

DOI10.1016/0166-218X(93)90049-TMaRDI QIDQ1803678zbMATH OpenFDO

Authors Philippe Michelon, Nelson Maculan

Publication date 29 June 1993

Published in Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

0-1 quadratic programmingLagrangean methods

Mathematics Subject Classification ID

Quadratic programming (90C20) Boolean programming (90C09)

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

• {{#invoke:WikidataIB|getLink|Q3932576}} scientific article; zbMATH DE number 3748742 (Why is no real title available?)
• {{#invoke:WikidataIB|getLink|Q3960718}} scientific article; zbMATH DE number 3783030 (Why is no real title available?)
• {{#invoke:WikidataIB|getLink|Q4178782}} scientific article; zbMATH DE number 3614502 (Why is no real title available?)
• {{#invoke:WikidataIB|getLink|Q1181738}} Lagrangean decomposition for integer nonlinear programming with linear constraints
• {{#invoke:WikidataIB|getLink|Q3780005}} Lagrangean decomposition: A model yielding stronger lagrangean bounds
• {{#invoke:WikidataIB|getLink|Q3863696}} Methods of Nonlinear 0-1 Programming
• {{#invoke:WikidataIB|getLink|Q4090127}} Minimum cuts and related problems
• {{#invoke:WikidataIB|getLink|Q3765553}} Problème de la bipartition minimale d'un graphe

Cited in

(13)

• 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
• Decomposition and linearization for 0-1 quadratic programming
• Classroom Note: The Lagrange--Charpit Method
• A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs
• A nonlinear Lagrangian dual for integer programming
• A Decomposition Method for Quadratic Zero-One Programming
• Dualité lagrangienne en programmation fractionnaire concave-convexe en variables 0–1
• An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating
• Lagrangean decompositions for the unconstrained binary quadratic programming problem
• Lagrangian decomposition of block-separable mixed-integer all-quadratic programs

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)