Weight-based Heuristics for Constraint Satisfaction and Combinatorial Optimization Problems
- 16 February 2012
- journal article
- Published by Springer Nature in Journal of Mathematical Modelling and Algorithms
- Vol. 11 (2) , 193-215
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Generalized disjunctive constraint propagation for solving the job shop problem with time lagsEngineering Applications of Artificial Intelligence, 2011
- Discrepancy search for the flexible job shop scheduling problemComputers & Operations Research, 2010
- Parallel machine scheduling with precedence constraints and setup timesComputers & Operations Research, 2010
- New filtering algorithms for combinations of among constraintsConstraints, 2009
- A memetic algorithm for the job-shop with time-lagsComputers & Operations Research, 2008
- Local search algorithms for a single-machine scheduling problem with positive and negative time-lagsDiscrete Applied Mathematics, 2001
- Logic‐Based Methods for Optimization2000
- A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lagsDiscrete Applied Mathematics, 1999
- Constraint satisfaction using constraint logic programmingArtificial Intelligence, 1992
- Increasing tree search efficiency for constraint satisfaction problemsArtificial Intelligence, 1980