Weight-based heuristics for constraint satisfaction and combinatorial optimization problems
type: Item
instance of: scholarly article
title: Weight-based heuristics for constraint satisfaction and combinatorial optimization problems
zbMATH Open document ID: 1263.90131
author: Marie-José Huguet
author: Pierre Lopez
author: Wafa Karoui
published in: JMMA. Journal of Mathematical Modelling and Algorithms
publication date: 2013-05-29T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6167985
zbMATH Keywords: weight-based heuristics
zbMATH Keywords: tree search
zbMATH Keywords: constraint satisfaction
zbMATH Keywords: scheduling
describes a project that uses: YIELDS
MaRDI profile type: Publication
full work available at URL: s10852-012-9174-8
OpenAlex ID: W4301915111
cites work: A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags
cites work: A memetic algorithm for the job-shop with time-lags
cites work: Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
cites work: Parallel machine scheduling with precedence constraints and setup times
cites work: Constraint satisfaction using constraint logic programming
cites work: Discrepancy search for the flexible job shop scheduling problem
cites work: New filtering algorithms for combinations of among constraints
cites work: Q4523706
cites work: Local search algorithms for a single-machine scheduling problem with positive and negative time-lags
cites work: YIELDS: A Yet Improved Limited Discrepancy Search for CSPs
cites work: Q5457275
cites work: Q4437036
cites work: The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem
cites work: One-machine generalized precedence constrained scheduling problems
cites work: Random constraint satisfaction: easy generation of hard (satisfiable) instances
DOI: 10.1007/S10852-012-9174-8
description: scientific article; zbMATH DE number 6167985