Weight-based heuristics for constraint satisfaction and combinatorial optimization problems

DOI10.1007/s10852-012-9174-8zbMath1263.90131OpenAlexW4301915111MaRDI QIDQ1951176

Marie-José Huguet, Pierre Lopez, Wafa Karoui

Publication date: 29 May 2013

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10852-012-9174-8

zbMATH Keywords

schedulingconstraint satisfactiontree searchweight-based heuristics

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85)

Uses Software

• YIELDS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New filtering algorithms for combinations of among constraints
• The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem
• Parallel machine scheduling with precedence constraints and setup times
• Discrepancy search for the flexible job shop scheduling problem
• Random constraint satisfaction: easy generation of hard (satisfiable) instances
• Constraint satisfaction using constraint logic programming
• A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags
• One-machine generalized precedence constrained scheduling problems
• Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
• A memetic algorithm for the job-shop with time-lags
• YIELDS: A Yet Improved Limited Discrepancy Search for CSPs
• Local search algorithms for a single-machine scheduling problem with positive and negative time-lags