scientific article; zbMATH DE number 1149402
From MaRDI portal
Publication:4386920
Recommendations
- Toward a model for backtracking and dynamic programming
- scientific article; zbMATH DE number 2102781
- scientific article; zbMATH DE number 2084765
- Backing backtracking
- An improved backward algorithm on dynamic programming
- scientific article; zbMATH DE number 5012413
- scientific article; zbMATH DE number 1003251
Cited in
(70)- Reasoning from last conflict(s) in constraint programming
- Forward checking and intelligent backtracking
- On the relations between intelligent backtracking and failure-driven explanation-based learning in constraint satisfaction and planning
- A theoretical evaluation of selected backtracking algorithms.
- SAT problems with chains of dependent variables
- Backtracking algorithms for disjunctions of temporal constraints
- Search algorithms in type theory
- Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems
- Backtracking tactics in the backtrack method for SAT
- Backjump-based backtracking for constraint satisfaction problems
- Local search with constraint propagation and conflict-based heuristics
- Proving unsatisfiability of CNFs locally
- A SAT approach to query optimization in mediator systems
- An improved data-dependency-based backtracking scheme for Prolog
- Metaheuristics: A bibliography
- Experiments with conflict analysis in mixed integer programming
- Computational aspects of infeasibility analysis in mixed integer programming
- Backing backtracking
- Explanation-based large neighborhood search
- MCS---a new algorithm for multicriteria optimisation in constraint programming
- The model evolution calculus as a first-order DPLL method
- A CSP search algorithm with responsibility sets and kernels
- Concurrent search for distributed CSPs
- Conflict analysis in mixed integer programming
- What we can learn from conflicts in propositional satisfiability
- Dynamic backward reasoning systems
- Conflict-directed \(A^{*}\) and its role in model-based embedded systems
- Random backtracking in backtrack search algorithms for satisfiability
- Trail saving on backtrack
- An empirical study of phase transitions in binary constraint satisfaction problems
- Achieving consistency with cutting planes
- Generating feasible schedules for a pick-up and delivery problem
- Using an incomplete version of dynamic backtracking for graph colouring
- The path-repair algorithm
- Combining preorder and postorder resolution in a satisfiability solver
- The Relation Between Complete and Incomplete Search
- Between restarts and backjumps
- Backtrack Programming with SIMULA
- Computing and restoring global inverse consistency in interactive constraint satisfaction
- scientific article; zbMATH DE number 5012413 (Why is no real title available?)
- MUST: Provide a Finer-Grained Explanation of Unsatisfiability
- Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance
- A Flexible Search Framework for CHR
- Adaptive CHR Meets CHR ∨
- Constraint Propagation with Tabu List for Min-Span Frequency Assignment Problem
- The ComBack method revisited: caching strategies and extension with delayed duplicate detection
- Learning from conflicts in propositional satisfiability
- STR2: optimized simple tabular reduction for table constraints
- scientific article; zbMATH DE number 1086900 (Why is no real title available?)
- scientific article; zbMATH DE number 2080311 (Why is no real title available?)
- Building decision procedures for modal logics from propositional decision procedures -- the case study of modal K
- scientific article; zbMATH DE number 2086968 (Why is no real title available?)
- Nogood-based asynchronous forward checking algorithms
- Conflict Analysis for MINLP
- About the choice of the variable to unassign in a decision repair algorithm
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
- On a reduction of the interval coloring problem to a series of bandwidth coloring problems
- Ratchet-mediated resetting: current, efficiency, and exact solution
- Modeling and generating user-centered contrastive explanations for the workforce scheduling and routing problem
- Stochastic resetting in the infinite range Ising model
- Hybrid backtracking bounded by tree-decomposition of constraint networks
- Efficient solution techniques for disjunctive temporal reasoning problems
- Constraint solving in uncertain and dynamic environments: A survey
- Min-domain retroactive ordering for asynchronous backtracking
- Dynamic ordering for asynchronous backtracking on DisCSPs
- Heuristic-based backtracking relaxation for propositional satisfiability
- Message delay and DisCSP search algorithms
- Asynchronous forward-checking for DisCSPs
- A multi-level search strategy for the 0-1 multidimensional knapsack problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4386920)
