Pages that link to "Item:Q1204869"
From MaRDI portal
The following pages link to Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems (Q1204869):
Displaying 50 items.
- Genetic based discrete particle swarm optimization for elderly day care center timetabling (Q342133) (← links)
- A survey of repair methods used as constraint handling techniques in evolutionary algorithms (Q458493) (← links)
- Bounding, filtering and diversification in CP-based local branching (Q519096) (← links)
- Constraint satisfaction -- algorithms and complexity analysis (Q672029) (← links)
- Control abstractions for local search (Q816678) (← links)
- Constraint solving in uncertain and dynamic environments: A survey (Q816686) (← links)
- The island confinement method for reducing search space in local search methods (Q930151) (← links)
- Combining VNS with constraint programming for solving anytime optimization problems (Q932188) (← links)
- The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem (Q932211) (← links)
- ACS-TS: Train scheduling using ant colony system (Q955488) (← links)
- A branch and bound algorithm for numerical Max-CSP (Q968350) (← links)
- Global search algorithm for automated maintenance planning and scheduling of parts requests (Q1000953) (← links)
- Parallel and distributed local search in COMET (Q1010289) (← links)
- The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
- Experimental study on strategy of combining SAT algorithms (Q1273082) (← links)
- The computational complexity of propositional STRIPS planning (Q1337679) (← links)
- Exploiting the deep structure of constraint problems (Q1342216) (← links)
- Model-based inference in CHARME. (Q1342427) (← links)
- An intelligent system for US Coast Guard cutter scheduling (Q1390329) (← links)
- Networked bubble propagation: a polynomial-time hypothetical reasoning method for computing near-optimal solutions (Q1392104) (← links)
- Local search for shift design. (Q1417484) (← links)
- Backtracking algorithms for disjunctions of temporal constraints (Q1575430) (← links)
- A framework for structured quantum search. (Q1586960) (← links)
- A Lagrangian reconstruction of GENET (Q1589464) (← links)
- Local search with constraint propagation and conflict-based heuristics (Q1606115) (← links)
- A reusable iterative optimization software library to solve combinatorial problems with approximate reasoning (Q1606222) (← links)
- A tabu search approach to the constraint satisfaction problem as a general problem solver (Q1609921) (← links)
- A multiagent evolutionary algorithm with direct and indirect combined representation for constraint satisfaction problems (Q1701558) (← links)
- Enhanced multiple-point statistical simulation with backtracking, forward checking and conflict-directed backjumping (Q1740327) (← links)
- The min-conflict packing problem (Q1761135) (← links)
- Exploring relaxation induced neighborhoods to improve MIP solutions (Q1769074) (← links)
- A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search. (Q1853552) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Integrating domain and constraint privacy reasoning in the distributed stochastic algorithm with breakouts (Q2075368) (← links)
- A local search framework for industrial test laboratory scheduling (Q2241157) (← links)
- Large-scale parallelism for constraint-based local search: the costas array case study (Q2342606) (← links)
- Simple decentralized graph coloring (Q2397096) (← links)
- The distributed breakout algorithms (Q2457700) (← links)
- Generalised graph colouring by a hybrid of local search and constraint programming (Q2467347) (← links)
- Exploiting relaxation in local search for LABS (Q2468767) (← links)
- On-line resources allocation for ATM networks with rerouting (Q2489130) (← links)
- Distance-constrained grid colouring (Q2629563) (← links)
- Conflict-directed \(A^{*}\) and its role in model-based embedded systems (Q2643303) (← links)
- Phase transitions and the search problem (Q2674173) (← links)
- Refining the phase transition in combinatorial search (Q2674181) (← links)
- A probabilistic analysis of propositional STRIPS planning (Q2674188) (← links)
- Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems (Q2674191) (← links)
- Enhancing CLP branch and bound techniques for scheduling problems (Q2721220) (← links)
- Generating feasible schedules for a pick-up and delivery problem (Q2741264) (← links)
- Using an incomplete version of dynamic backtracking for graph colouring (Q2741266) (← links)
