The following pages link to (Q4386920):
Displaying 50 items.
- Computing and restoring global inverse consistency in interactive constraint satisfaction (Q334804) (← links)
- Learning from conflicts in propositional satisfiability (Q427560) (← links)
- STR2: optimized simple tabular reduction for table constraints (Q429802) (← links)
- Nogood-based asynchronous forward checking algorithms (Q481712) (← links)
- On a reduction of the interval coloring problem to a series of bandwidth coloring problems (Q633552) (← links)
- Hybrid backtracking bounded by tree-decomposition of constraint networks (Q814455) (← links)
- Efficient solution techniques for disjunctive temporal reasoning problems (Q814524) (← links)
- Constraint solving in uncertain and dynamic environments: A survey (Q816686) (← links)
- Min-domain retroactive ordering for asynchronous backtracking (Q842785) (← links)
- Dynamic ordering for asynchronous backtracking on DisCSPs (Q850468) (← links)
- Heuristic-based backtracking relaxation for propositional satisfiability (Q862398) (← links)
- Message delay and DisCSP search algorithms (Q862557) (← links)
- Asynchronous forward-checking for DisCSPs (Q879978) (← links)
- A multi-level search strategy for the 0-1 multidimensional knapsack problem (Q968116) (← links)
- Reasoning from last conflict(s) in constraint programming (Q1045989) (← links)
- Forward checking and intelligent backtracking (Q1263983) (← links)
- On the relations between intelligent backtracking and failure-driven explanation-based learning in constraint satisfaction and planning (Q1274559) (← links)
- A theoretical evaluation of selected backtracking algorithms. (Q1399134) (← links)
- SAT problems with chains of dependent variables (Q1408386) (← links)
- Backtracking algorithms for disjunctions of temporal constraints (Q1575430) (← links)
- Search algorithms in type theory (Q1575934) (← links)
- Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems (Q1590040) (← links)
- Backtracking tactics in the backtrack method for SAT (Q1596804) (← links)
- Backjump-based backtracking for constraint satisfaction problems (Q1605408) (← links)
- Local search with constraint propagation and conflict-based heuristics (Q1606115) (← links)
- Proving unsatisfiability of CNFs locally (Q1610678) (← links)
- A SAT approach to query optimization in mediator systems (Q1777403) (← links)
- An improved data-dependency-based backtracking scheme for Prolog (Q1823727) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Experiments with conflict analysis in mixed integer programming (Q2011593) (← links)
- Computational aspects of infeasibility analysis in mixed integer programming (Q2063195) (← links)
- Backing backtracking (Q2181937) (← links)
- Explanation-based large neighborhood search (Q2342597) (← links)
- MCS---a new algorithm for multicriteria optimisation in constraint programming (Q2379869) (← links)
- The model evolution calculus as a first-order DPLL method (Q2389629) (← links)
- A CSP search algorithm with responsibility sets and kernels (Q2454814) (← links)
- Concurrent search for distributed CSPs (Q2457634) (← links)
- Conflict analysis in mixed integer programming (Q2471271) (← links)
- What we can learn from conflicts in propositional satisfiability (Q2630816) (← links)
- Dynamic backward reasoning systems (Q2638814) (← links)
- Conflict-directed \(A^{*}\) and its role in model-based embedded systems (Q2643303) (← links)
- Random backtracking in backtrack search algorithms for satisfiability (Q2643305) (← links)
- Trail saving on backtrack (Q2661333) (← links)
- An empirical study of phase transitions in binary constraint satisfaction problems (Q2674179) (← links)
- Achieving consistency with cutting planes (Q2687054) (← 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)
- The path-repair algorithm (Q2741380) (← links)
- Combining preorder and postorder resolution in a satisfiability solver (Q2741518) (← links)
- The Relation Between Complete and Incomplete Search (Q2950519) (← links)
