Network-based heuristics for constraint-satisfaction problems
From MaRDI portal
(Redirected from Publication:1102137)
Recommendations
- Network based heuristics for the set covering problem
- scientific article; zbMATH DE number 4152177
- scientific article; zbMATH DE number 4049150
- Heuristics for the network design problem with connectivity requirements
- Weight-based heuristics for constraint satisfaction and combinatorial optimization problems
- Heuristics for dynamically adapting propagation in constraint satisfaction problems
- A heuristic algorithm for a network problem with variable upper bounds
- Tree optimization based heuristics and metaheuristics in network construction problems
Cites work
- scientific article; zbMATH DE number 4112072 (Why is no real title available?)
- scientific article; zbMATH DE number 3688740 (Why is no real title available?)
- scientific article; zbMATH DE number 3219315 (Why is no real title available?)
- A Sufficient Condition for Backtrack-Free Search
- A method for computing heuristics in problem solving
- A sufficient condition for backtrack-bounded search
- Consistency in networks of relations
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
- Estimating the Efficiency of Backtrack Programs
- Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
- Intelligent Backtracking in Plan-Based Deduction
- Networks of constraints: Fundamental properties and applications to picture processing
- Nonserial dynamic programming
- Planning in a hierarchy of abstraction spaces
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- The average complexity of depth-first search with backtracking and cutoff
Cited in
(only showing first 100 items - show all)- Domain permutation reduction for constraint satisfaction problems
- Semiring induced valuation algebras: exact and approximate local computation algorithms
- Uncovering trees in constraint networks
- Distributed personnel scheduling -- negotiation among scheduling agents
- Tractability in constraint satisfaction problems: a survey
- Decomposing a relation into a tree of binary relations
- Backjump-based backtracking for constraint satisfaction problems
- Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
- The essence of constraint propagation
- A general scheme for automatic generation of search heuristics from specification \(dependencies^{*}\)
- The job shop scheduling problem: Conventional and new solution techniques
- Maintaining reversible DAC for Max-CSP
- Temporal constraint networks
- On the hardness of approximate reasoning
- A logic-based analysis of Dempster-Shafer theory
- A canonical form for generalized linear constraints
- Tree clustering for constraint networks
- Characterising tractable constraints
- Decomposing constraint satisfaction problems using database techniques
- Qualitative probabilities for default reasoning, belief revision, and causal modeling
- On computing minimal models
- An information-based neural approach to constraint satisfaction
- Structure identification in relational data
- High-order consistency in valued constraint satisfaction
- Tradeoffs in the Complexity of Backdoor Detection
- Mixed deterministic and probabilistic networks
- On neighbourhood singleton-style consistencies for qualitative spatial and temporal reasoning
- Constraint propagation techniques for the disjunctive scheduling problem
- Metaheuristics: A bibliography
- Non-local configuration of component interfaces by constraint satisfaction
- Learning heuristic functions for large state spaces
- Constraint Satisfaction
- From local to global consistency
- Locating the phase transition in binary constraint satisfaction problems
- Iterative coloring extension of a maximum clique
- Processing disjunctions in temporal constraint networks
- Backtracking algorithms for disjunctions of temporal constraints
- Constraint solving for proof planning
- Fuzzy constraint networks for signal pattern recognition
- Symbolic techniques in satisfiability solving
- Artificial Intelligence: Methodology, Systems, and Applications
- Compiling constraint satisfaction problems
- On some partial line graphs of a hypergraph and the associated matroid
- Integer programs for logic constraint satisfaction
- A comparison of structural CSP decomposition methods
- Tractable reasoning via approximation
- Interleaving solving and elicitation of constraint satisfaction problems based on expected cost
- Distributed CSPs by graph partitioning
- Constraint relaxation may be perfect
- A naive algorithm for feedback vertex set
- scientific article; zbMATH DE number 4112072 (Why is no real title available?)
- Linear-programming design and analysis of fast algorithms for Max 2-CSP
- The complexity of reasoning with global constraints
- Tractable constraints on ordered domains
- A polynomial relational class of binary CSP
- The complexity of constraint satisfaction revisited
- An optimal coarse-grained arc consistency algorithm
- Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks
- Counting representable sets on simple graphs
- Constant-degree graph expansions that preserve treewidth
- Local and global relational consistency
- Propositional semantics for disjunctive logic programs
- Unifying tree decompositions for reasoning in graphical models
- Improving ABT Performance by Adding Synchronization Points
- Weighted heuristic search in networks
- Experimental evaluation of preprocessing algorithms for constraint satisfaction problems
- Probability propagation
- A tabu search approach to the constraint satisfaction problem as a general problem solver
- Hybrid tractability of valued constraint problems
- Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination
- A generic arc-consistency algorithm and its specializations
- A unified theory of structural tractability for constraint satisfaction problems
- Constraints, consistency and closure
- Asynchronous backtracking without adding links: a new member in the ABT family
- Partition search for non-binary constraint satisfaction
- Bounded-width QBF is PSPACE-complete
- Constraint solving in uncertain and dynamic environments: A survey
- Constraint reasoning based on interval arithmetic: The tolerance propagation approach
- Topological parameters for time-space tradeoff
- Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search
- Reduction operations in fuzzy or valued constraint satisfaction
- Combinatorial problems raised from 2-semilattices
- An optimal backtrack algorithm for tree-structured constraint satisfaction problems
- AND/OR search spaces for graphical models
- A new tractable class of constraint satisfaction problems
- Querying temporal and spatial constraint networks in PTIME
- Investigating production system representations for non-combinatorial match
- Local consistency in parallel constraint satisfaction networks
- Problem solving by searching for models with a theorem prover
- scientific article; zbMATH DE number 2086984 (Why is no real title available?)
- Default reasoning using classical logic
- Solving the minimum-weighted coloring problem
- Fuzzy reasoning in a multidimensional space of hypotheses
- Constraint reasoning
- Scheduling with neural networks -- the case of the Hubble Space Telescope
- A non-binary constraint ordering heuristic for constraint satisfaction problems
- scientific article; zbMATH DE number 1882057 (Why is no real title available?)
- Dynamic variable ordering in graph based backjumping algorithms for csps
- Dynamic algorithms for classes of constraint satisfaction problems
- A framework for decision support systems of scheduling problems
This page was built for publication: Network-based heuristics for constraint-satisfaction problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1102137)
