Abstraction in constraint optimization problems

MaRDI QIDQ4902266zbMATH OpenFDO

Authors Alexandru I. Tomescu

Publication date 14 January 2013

zbMATH Keywords

backtrackingbranch-and-boundcombinatorial optimizationconstraint logic programminglook-ahead techniqueslook-back techniquesschedulingsearch-based algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Abstracting soft constraints: framework, properties, examples
• Backjump-based backtracking for constraint satisfaction problems
• scientific article; zbMATH DE number 1759706
• scientific article; zbMATH DE number 1728539
• Recent Advances in Constraints

Cited in

(3)

• A graph-based modeling abstraction for optimization: concepts and implementation in Plasmo.jl
• Modelling cyclicity and generalized cost-based abduction using linear constraint satisfaction
• scientific article; zbMATH DE number 5235691 (Why is no real title available?)

This page was built for publication: Abstraction in constraint optimization problems

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