Constraint programming based Lagrangian relaxation for the automatic recording problem

DOI10.1023/A:1021845304798zbMath1026.90510MaRDI QIDQ1861933

Torsten Fahle, Meinolf Sellmann

Publication date: 10 March 2003

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

Lagrangian relaxationknapsack constraintoptimization constraintmaximum weighted stable set constraint

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Applications of mathematical programming (90C90)

Related Items

Constraint programming and operations research ⋮ A Lagrangian propagator for artificial neural networks in constraint programming ⋮ New filtering for \textsc{AtMostNValue} and its weighted variant: a Lagrangian approach ⋮ Cost-based filtering for shorter path constraints ⋮ Bounding, filtering and diversification in CP-based local branching ⋮ New model and heuristics for safety stock placement in general acyclic supply chain networks ⋮ Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm ⋮ Approximated consistency for the automatic recording constraint