Relaxation on Optimization Predicates

DOI10.1007/11799573_33MaRDI QIDQ5449620zbMATH OpenOpenAlexFDO

Authors Haifeng Guo, M. Liu, Bharat Jayaraman

Publication date 11 March 2008

Published in Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11799573_33

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Hierarchical constraint logic programming
• Extending HCLP with partially ordered hierarchies and composite constraints
• An efficient algorithm of logic programming with constraint hierarchy
• scientific article; zbMATH DE number 1926617
• Industrial linear optimization problems solved by constraint logic programming

Cited in

(6)

• Temporal linear relaxation in IBM ILOG CP optimizer
• scientific article; zbMATH DE number 1059310 (Why is no real title available?)
• Extending HCLP with partially ordered hierarchies and composite constraints
• scientific article; zbMATH DE number 5877344 (Why is no real title available?)
• Extended McCormick relaxation rules for handling empty arguments representing infeasibility
• Relaxation in greedy approximation

This page was built for publication: Relaxation on Optimization Predicates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5449620)