A General Approach for Constraint Solving by Local Search

No abstract is available for this paper.

• Publication year

  2004

• Venue

  J. Math. Model. Algorithms

• Publication date

  2004-03-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1023/B:JMMA.0000026709.24659.da
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Distributed Constraint Satisfaction

  2004cited by this paper
• Optimization Software Class Libraries

  2002cited by this paper
• Yet Another Local Search Method for Constraint Solving

  2001cited by this paper
• A General Meta-Heuristic Based Solver for Combinatorial Optimisation Problems

  2001cited by this paper
• A Lagrangian reconstruction of GENET

  2000cited by this paper
• Integer Optimization by Local Search

  2000cited by this paper
• Solving the Progressive Party Problem by Local Search

  1999cited by this paper
• Hybrid Evolutionary Algorithms for Graph Coloring

  1999cited by this paper
• A tabu search approach to the constraint satisfaction problem as a general problem solver

  1998cited by this paper
• Tabu Search for Frequency Assignment in Mobile Radio Networks

  1998influential reference
• Local Search in Combinatorial Optimisation.

  1997cited by this paper
• Tabu Search for Maximal Constraint Satisfaction Problems

  1997cited by this paper
• Tabu Search

  1997cited by this paper
• Organizing a social event - A difficult problem of combinatorial optimization

  1996cited by this paper
• An Object-Oriented Methodology for Solving Assignment-Type Problems with Neighborhood Search Techniques

  1996cited by this paper
• The progressive party problem: Integer linear programming and constraint programming compared

  1995cited by this paper
• GENET: A Connectionist Architecture for Solving Constraint Satisfaction Problems by Iterative Improvement

  1994cited by this paper
• Foundations of constraint satisfaction

  1993cited by this paper
• Object-oriented implementation of heuristic search methods for Graph Coloring, Maximum Clique, and Satisfiability

  1993cited by this paper
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning

  1991cited by this paper
• Using tabu search techniques for graph coloring

  1987cited by this paper
• Optimization by Simulated Annealing

  1983cited by this paper

• Modeling constraint-based manufacturing networks: theory, application and best practices

  2025cites this paper
• Exploring Maze Navigation: A Comparative Study of DFS, BFS, and A* Search Algorithms.

  2024cites this paper
• Quantum and Digital Annealing for the Quadratic Assignment Problem

  2022cites this paper
• Error function learning with interpretable compositional networks for constraint-based local search

  2021cites this paper
• Constraint Solving by Quantum Annealing

  2021cites this paper
• A hybrid CP/MOLS approach for multi-objective imbalanced classification

  2021cites this paper
• Integrating domain and constraint privacy reasoning in the distributed stochastic algorithm with breakouts

  2021cites this paper
• Automatic error function learning with interpretable compositional networks

  2020cites this paper
• Sizing of a Battery Pack Based on Series/Parallel Configurations for a High-Power Electric Vehicle as a Constrained Optimization Problem

  2020cites this paper
• Meta-heuristics and Artificial Intelligence

  2020cites this paper
• Performance Analysis and Mitigating the Challenges of Constraint-based Local Search

  2019cites this paper
• An Optimization Heuristic Based on Non-Dominated Sorting and Tabu Search for the Fixed Spectrum Frequency Assignment Problem

  2018cites this paper
• A Neighborhood Search-Based Heuristic for the Fixed Spectrum Frequency Assignment Problem

  2018cites this paper
• A penalty-based Tabu search for constrained covering arrays

  2017cites this paper
• Méta-heuristiques et intelligence artificielle

  2014cites this paper
• A GPU Implementation of Parallel Constraint-Based Local Search

  2014cites this paper
• Large-scale parallelism for constraint-based local search: the costas array case study

  2014cites this paper
• Sélection adaptative d'opérateurs en recherche locale et Progressive Party Problem

  2013influential citation
• Using Local Search with adaptive operator selection to solve the Progressive Party Problem

  2013cites this paper
• Algorithms for irreducible infeasible subset detection in CSP - Application to frequency planning and graph k-coloring. (Algorithmes pour la détection d'un sous ensemble irréalisable irréductible dans un CSP - Applications aux problèmes d'affectation des fréquences et problème de k-coloration)

  2012cites this paper
• Parallel Local Search for the Costas Array Problem

  2012cites this paper
• Targeting the Cell Broadband Engine for constraint‐based local search

  2012cites this paper
• Prediction of Parallel Speed-Ups for Las Vegas Algorithms

  2012cites this paper
• Memetic Algorithms in Discrete Optimization

  2012cites this paper
• Communication in Parallel Algorithms for Constraint-Based Local Search

  2011cites this paper
• The case for strategic oscillation

  2011cites this paper
• Over-Constrained Problems

  2011cites this paper
• Constraint Programming and Local Search Hybrids

  2011cites this paper
• Experiments in Parallel Constraint-Based Local Search

  2011cites this paper
• A tabu search algorithm for the covering design problem

  2011cites this paper
• Multicriteria models for planning power-networking events

  2010cites this paper
• Tabu Search for Constraint Solving and Its Applications

  2010cites this paper
• CSP4J: a black-box CSP solving API for Java

  2007cites this paper
• Hybridation de prouveurs CSP et apprentissage

  2007cites this paper
• Breaking Out CSPs

  2007influential citation
• Generic Incremental Algorithms for Local Search

  2007cites this paper
• Contributions à la résolution générique des problèmes de satisfaction de contraintes. (Contributions to Generic Solving of Constraint Satisfaction Problems)

  2007cites this paper
• Proceedings of the CP 2006 Doctoral Programme

  2006cites this paper
• Inferring Variable Conflicts for Local Search from High-Level Models

  2006cites this paper
• Heuristic Methods for Automatic Rotating Workforce Scheduling

  2006cites this paper
• Inferring Variable Conflicts for Local Search

  2006cites this paper
• Min Conflicts Based Heuristics for Rotating Workforce Scheduling Problem

  2005cites this paper
• A Heuristic Solution for a Driver-Vehicle Scheduling Problem

  2005cites this paper
• Contraint-Based Combinators for Local Search

  2005cites this paper
• Escaping local optima with penalties in distributed iterative improvement search.

  2005cites this paper
• Constraint Languages for Combinatorial Optimization

  2005cites this paper
• High-level modelling and local search

  2005cites this paper
• A Simple and Efficient Tabu Search

  2005cites this paper
• Effect of Learning the Problem Topography on Stochastic Search

  2005cites this paper
• Design and implementation of a graph-based constraint model for local search

  2004influential citation
• 1st International Workshop on Local Search Techniques in Constraint Satisfaction

  2004cites this paper
• Stochastic solver for constraint satisfaction problems with learning of high-level characteristics of the problem topography

  2004cites this paper
• Set Variables and Local Search

  2004cites this paper
• A Local Search System for Solving Constraint Problems of Declarative Graph-Based Global Constraints

  2004influential citation
• An Improved Time-Sensitive Metaheuristic Framework for Combinatorial Optimization

  2004cites this paper
• Applying tabu search to the rotating workforce scheduling problem

  2003cites this paper
• Control Abstractions for Local Search

  2003cites this paper
• Comet in context

  2003cites this paper
• Optimization of physical flows in an automotive manufacturing plant: some experiments and issues

  2003cites this paper
• Maintaining Longest Paths Incrementally

  2003cites this paper
• The Adaptive Search Method for Constraint Solving and its application to musical CSPs

  2002cites this paper
• A constraint-based architecture for local search

  2002cites this paper
• Meta-heuristics and Artificial Intelligence

  year unknowncites this paper