Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
From MaRDI portal
Recommendations
Cites work
- Almost all k-colorable graphs are easy to color
- An almost perfect heuristic for the N nonattacking queens problem
- Backtrack programming techniques
- How easy is local search?
- scientific article; zbMATH DE number 4174368 (Why is no real title available?)
- scientific article; zbMATH DE number 4162299 (Why is no real title available?)
- scientific article; zbMATH DE number 67466 (Why is no real title available?)
- scientific article; zbMATH DE number 67483 (Why is no real title available?)
- scientific article; zbMATH DE number 193197 (Why is no real title available?)
- scientific article; zbMATH DE number 194622 (Why is no real title available?)
- Network-based heuristics for constraint-satisfaction problems
- Neural networks and physical systems with emergent collective computational abilities
- New methods to color the vertices of a graph
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- Scheduling with neural networks -- the case of the Hubble Space Telescope
- Using tabu search techniques for graph coloring
Cited in
(69)- Global search algorithm for automated maintenance planning and scheduling of parts requests
- Parallel and distributed local search in COMET
- The job shop scheduling problem: Conventional and new solution techniques
- Experimental study on strategy of combining SAT algorithms
- The computational complexity of propositional STRIPS planning
- Exploiting the deep structure of constraint problems
- Model-based inference in CHARME.
- An intelligent system for US Coast Guard cutter scheduling
- Networked bubble propagation: a polynomial-time hypothetical reasoning method for computing near-optimal solutions
- Local search for shift design.
- Backtracking algorithms for disjunctions of temporal constraints
- A framework for structured quantum search.
- A Lagrangian reconstruction of GENET
- 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
- A multiagent evolutionary algorithm with direct and indirect combined representation for constraint satisfaction problems
- Enhanced multiple-point statistical simulation with backtracking, forward checking and conflict-directed backjumping
- The min-conflict packing problem
- Exploring relaxation induced neighborhoods to improve MIP solutions
- A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search.
- Metaheuristics: A bibliography
- Integrating domain and constraint privacy reasoning in the distributed stochastic algorithm with breakouts
- A local search framework for industrial test laboratory scheduling
- Large-scale parallelism for constraint-based local search: the costas array case study
- Simple decentralized graph coloring
- The distributed breakout algorithms
- Generalised graph colouring by a hybrid of local search and constraint programming
- Exploiting relaxation in local search for LABS
- On-line resources allocation for ATM networks with rerouting
- Distance-constrained grid colouring
- Conflict-directed \(A^{*}\) and its role in model-based embedded systems
- 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
- Enhancing CLP branch and bound techniques for scheduling problems
- Generating feasible schedules for a pick-up and delivery problem
- Using an incomplete version of dynamic backtracking for graph colouring
- The path-repair algorithm
- Finding the right hybrid algorithm -- a combinatorial meta-problem
- Resource allocation in a mobile telephone network: A constructive repair algorithm
- Decision incorporation in meta-heuristics to cope with decision scheduling problems
- Rough classification based on correlation clustering
- The Relation Between Complete and Incomplete Search
- Stochastic local search for SMT: combining theory solvers with WalkSAT
- Genetic based discrete particle swarm optimization for elderly day care center timetabling
- Equilibria of Iterative Softmax and Critical Temperatures for Intermittent Search in Self-Organizing Neural Networks
- scientific article; zbMATH DE number 2084745 (Why is no real title available?)
- Tabu Search for Vehicle Routing Problems (VRPs)
- A survey of repair methods used as constraint handling techniques in evolutionary algorithms
- Improving the randomization step in feasibility pump
- A New Algorithm To Solve Vehicle Routing Problems (VRPs)
- Bounding, filtering and diversification in CP-based local branching
- scientific article; zbMATH DE number 4187150 (Why is no real title available?)
- Multi-agent oriented constraint satisfaction
- 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
- Conflict optimization for binary CSP applied to minimum partition into plane subgraphs and graph coloring
- Meta-heuristics and artificial intelligence
- Constraint satisfaction -- algorithms and complexity analysis
- A new heuristic algorithm for student-project allocation with lecturer preferences and ties
- Control abstractions for local search
- Constraint solving in uncertain and dynamic environments: A survey
- 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
- ACS-TS: Train scheduling using ant colony system
- A branch and bound algorithm for numerical Max-CSP
This page was built for publication: Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1204869)
