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