Linear relaxations and reduced-Cost based propagation of continuous variable subscripts

DOI10.1023/A:1021136801775zbMath1011.90030MaRDI QIDQ1854751

Greger Ottosson, Erlendur S. Thorsteinsson

Publication date: 27 January 2003

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

zbMATH Keywords

integrationmixed integer programmingconstraint logic programmingreduced costsdynamic linear relaxationsinference,propagationmixed global constraintsvariable subscripts

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Related Items (4)

Domain reduction techniques for global NLP and MINLP optimization ⋮ Cost-based filtering for shorter path constraints ⋮ A first look at picking dual variables for maximizing reduced cost fixing ⋮ Solving an integrated employee timetabling and job-shop scheduling problem via hybrid branch-and-bound

Uses Software

• SICStus

This page was built for publication: Linear relaxations and reduced-Cost based propagation of continuous variable subscripts