Towards a closer integration of finite domain propagation and simplex-based algorithms

DOI10.1023/A:1018977712248zbMath0906.90146OpenAlexW57567154MaRDI QIDQ1265905

Barry Richards, Hani El-Sakkout, Mozafar T. Hajian, Jonathan M. Lever, Mark G. Wallace

Publication date: 27 September 1998

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

Full work available at URL: https://doi.org/10.1023/a:1018977712248

zbMATH Keywords

integer programmingcombinatorial optimizationbranch-and-boundsimplex methodconstraint satisfactionfinite domain propagation

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (3)

A Column Generation Model for a Scheduling Problem with Maintenance Constraints ⋮ Constraint logic programming and integer programming approaches and their collaboration in solving an assignment scheduling problem ⋮ Accelerating column generation for aircraft scheduling using constraint propagation

This page was built for publication: Towards a closer integration of finite domain propagation and simplex-based algorithms