Constraint programming based Lagrangian relaxation for the automatic recording problem
type: Item
instance of: scholarly article
title: Constraint programming based Lagrangian relaxation for the automatic recording problem
zbMATH Open document ID: 1026.90510
DOI: 10.1023/A:1021845304798
author: Meinolf Sellmann
author: Torsten Fahle
published in: Annals of Operations Research
publication date: 2003-03-10T00:00:00Z
Mathematics Subject Classification ID: 90C06
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 1878987
zbMATH Keywords: optimization constraint
zbMATH Keywords: maximum weighted stable set constraint
zbMATH Keywords: knapsack constraint
zbMATH Keywords: Lagrangian relaxation
MaRDI profile type: Publication
Recommended article: Approximated consistency for the automatic recording constraint
Recommended article: Q4796172
Recommended article: A Lagrangean relaxation method for the constrained assignment problem
Recommended article: Lagrangian relaxation and constraint generation for allocation and advanced scheduling
Recommended article: Lagrangian relaxation and enumeration for solving constrained shortest-path problems
Recommended article: Automatic synthesis of constraints from examples using mixed integer linear programming
Recommended article: Exploiting semidefinite relaxations in constraint programming
Recommended article: A lagrangean relaxation algorithm for the constrained matrix problem
description: scientific article; zbMATH DE number 1878987