Relaxation Lagrangienne: Le Probleme Du Knapsack 0–1†

DOI10.1080/03155986.1983.11731906zbMath0527.90073OpenAlexW2408377497MaRDI QIDQ3042878

Nelson F. Maculan

Publication date: 1983

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03155986.1983.11731906

zbMATH Keywords

Lagrangian relaxationimplicit enumerationassociated linear programknapsack 0-1 problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Boolean programming (90C09)

Related Items (2)

Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints: Properties and algorithms ⋮ Solving TSP through the Integration of OR and CP Techniques

This page was built for publication: Relaxation Lagrangienne: Le Probleme Du Knapsack 0–1^†