Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
From MaRDI portal
Publication:1204869
DOI10.1016/0004-3702(92)90007-KzbMath0782.90054OpenAlexW2121766240WikidataQ56168972 ScholiaQ56168972MaRDI QIDQ1204869
Publication date: 1 April 1993
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0004-3702(92)90007-k
Related Items
The computational complexity of propositional STRIPS planning, Exploiting the deep structure of constraint problems, Model-based inference in CHARME., Distance-constrained grid colouring, Stochastic Local Search for SMT: Combining Theory Solvers with WalkSAT, Tabu Search for Vehicle Routing Problems (VRPs), Conflict-directed \(A^{*}\) and its role in model-based embedded systems, Genetic based discrete particle swarm optimization for elderly day care center timetabling, Simple decentralized graph coloring, Unnamed Item, Unnamed Item, Metaheuristics: A bibliography, Enhancing CLP branch and bound techniques for scheduling problems, An intelligent system for US Coast Guard cutter scheduling, Phase transitions and the search problem, Refining the phase transition in combinatorial search, A probabilistic analysis of propositional STRIPS planning, Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems, Rough Classification Based on Correlation Clustering, Networked bubble propagation: a polynomial-time hypothetical reasoning method for computing near-optimal solutions, The Relation Between Complete and Incomplete Search, Local search approaches for the test laboratory scheduling problem with variable task grouping, Probabilistic analysis of local search and NP-completeness result for constraint satisfaction, Improving the Randomization Step in Feasibility Pump, A multiagent evolutionary algorithm with direct and indirect combined representation for constraint satisfaction problems, Local search for shift design., A survey of repair methods used as constraint handling techniques in evolutionary algorithms, The island confinement method for reducing search space in local search methods, Combining VNS with constraint programming for solving anytime optimization problems, The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem, The distributed breakout algorithms, Enhanced multiple-point statistical simulation with backtracking, forward checking and conflict-directed backjumping, Constraint satisfaction -- algorithms and complexity analysis, Generalised graph colouring by a hybrid of local search and constraint programming, A local search framework for industrial test laboratory scheduling, Exploiting relaxation in local search for LABS, Generating Feasible Schedules for a Pick-up and Delivery Problem, Using an Incomplete Version of Dynamic Backtracking for Graph Colouring, ACS-TS: Train scheduling using ant colony system, Bounding, filtering and diversification in CP-based local branching, The min-conflict packing problem, A branch and bound algorithm for numerical Max-CSP, On-line resources allocation for ATM networks with rerouting, Exploring relaxation induced neighborhoods to improve MIP solutions, Resource allocation in a mobile telephone network: A constructive repair algorithm, Multi-agent oriented constraint satisfaction, Global search algorithm for automated maintenance planning and scheduling of parts requests, Parallel and distributed local search in COMET, A New Algorithm To Solve Vehicle Routing Problems (VRPs), The job shop scheduling problem: Conventional and new solution techniques, Experimental study on strategy of combining SAT algorithms, Integrating domain and constraint privacy reasoning in the distributed stochastic algorithm with breakouts, Backtracking algorithms for disjunctions of temporal constraints, A framework for structured quantum search., A Lagrangian reconstruction of GENET, A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search., Large-scale parallelism for constraint-based local search: the costas array case study, Decision Incorporation in Meta-heuristics to Cope with Decision Scheduling Problems, Equilibria of Iterative Softmax and Critical Temperatures for Intermittent Search in Self-Organizing Neural Networks, Local search with constraint propagation and conflict-based heuristics, A reusable iterative optimization software library to solve combinatorial problems with approximate reasoning, A tabu search approach to the constraint satisfaction problem as a general problem solver, Control abstractions for local search, Constraint solving in uncertain and dynamic environments: A survey
Uses Software
Cites Work
- Using tabu search techniques for graph coloring
- An almost perfect heuristic for the N nonattacking queens problem
- Network-based heuristics for constraint-satisfaction problems
- How easy is local search?
- Scheduling with neural networks -- the case of the Hubble Space Telescope
- Almost all k-colorable graphs are easy to color
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- Backtrack programming techniques
- New methods to color the vertices of a graph
- Neural networks and physical systems with emergent collective computational abilities.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
