Pages that link to "Item:Q1204869"

The following pages link to Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems (Q1204869):

Displayed 42 items.

• 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)
• 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)
• 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)
• Conflict-directed \(A^{*}\) and its role in model-based embedded systems (Q2643303) ‎ (← links)
• (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)
• (Q2741380) ‎ (← links)
• (Q2741387) ‎ (← links)
• Resource allocation in a mobile telephone network: A constructive repair algorithm (Q2773168) ‎ (← links)
• Equilibria of Iterative Softmax and Critical Temperatures for Intermittent Search in Self-Organizing Neural Networks (Q3440428) ‎ (← links)
• Tabu Search for Vehicle Routing Problems (VRPs) (Q4551462) ‎ (← links)
• A New Algorithm To Solve Vehicle Routing Problems (VRPs) (Q4709847) ‎ (← links)
• Multi-agent oriented constraint satisfaction (Q5958494) ‎ (← links)