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)- Default reasoning using classical logic
- Polynomial algorithm of limited propositional deduction
- Metaheuristics: A bibliography
- Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
- Maintaining reversible DAC for Max-CSP
- Backjump-based backtracking for constraint satisfaction problems
- Constraint reasoning based on interval arithmetic: The tolerance propagation approach
- AND/OR search spaces for graphical models
- A naive algorithm for feedback vertex set
- Accelerating exact and approximate inference for (distributed) discrete optimization with GPUs
- Constraint solving in uncertain and dynamic environments: A survey
- scientific article; zbMATH DE number 2086984 (Why is no real title available?)
- Bounded-width QBF is PSPACE-complete
- Structure identification in relational data
- Fuzzy constraint networks for signal pattern recognition
- Compiling constraint satisfaction problems
- Querying temporal and spatial constraint networks in PTIME
- Uncovering trees in constraint networks
- Modeling and solving constraint satisfaction problems through Petri nets
- Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks
- On neighbourhood singleton-style consistencies for qualitative spatial and temporal reasoning
- Non-local configuration of component interfaces by constraint satisfaction
- Dynamic algorithms for classes of constraint satisfaction problems
- Distributed personnel scheduling -- negotiation among scheduling agents
- Constraint propagation techniques for the disjunctive scheduling problem
- Decomposing a relation into a tree of binary relations
- A logic-based analysis of Dempster-Shafer theory
- On some partial line graphs of a hypergraph and the associated matroid
- Locating the phase transition in binary constraint satisfaction problems
- Local and global relational consistency
- An algebraic characterization of tractable constraints
- Probability propagation
- A statistical approach to adaptive problem solving
- From local to global consistency in temporal constraint networks
- An optimal backtrack algorithm for tree-structured constraint satisfaction problems
- Symbolic techniques in satisfiability solving
- Processing disjunctions in temporal constraint networks
- Solving the minimum-weighted coloring problem
- scientific article; zbMATH DE number 1882057 (Why is no real title available?)
- The essence of constraint propagation
- Experimental evaluation of preprocessing algorithms for constraint satisfaction problems
- Tractability in constraint satisfaction problems: a survey
- Asynchronous backtracking without adding links: a new member in the ABT family
- Backtracking algorithms for disjunctions of temporal constraints
- Parallel consistent labeling algorithms
- Some fundamental properties of local constraint propagation
- Tradeoffs in the Complexity of Backdoor Detection
- Learning heuristic functions for large state spaces
- Artificial Intelligence: Methodology, Systems, and Applications
- Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination
- Mixed deterministic and probabilistic networks
- Constant-degree graph expansions that preserve treewidth
- Hybrid tractability of valued constraint problems
- The complexity of conservative valued CSPs
- Qualitative probabilities for default reasoning, belief revision, and causal modeling
- A framework for decision support systems of scheduling problems
- Temporal constraint networks
- A methodology for the reduction of imprecision in the engineering process
- Tractable constraints on ordered domains
- A unified theory of structural tractability for constraint satisfaction problems
- Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
- Topological parameters for time-space tradeoff
- Understanding the scalability of Bayesian network inference using clique tree growth curves
- Distributed CSPs by graph partitioning
- A polynomial relational class of binary CSP
- An information-based neural approach to constraint satisfaction
- Unifying tree decompositions for reasoning in graphical models
- From local to global consistency
- No more ``Partial and ``Full Looking Ahead
- Constraints, consistency and closure
- Characterising tractable constraints
- Decomposing constraint satisfaction problems using database techniques
- Counting representable sets on simple graphs
- Propositional semantics for disjunctive logic programs
- The complexity of constraint satisfaction revisited
- Constraint reasoning
- A comparison of structural CSP decomposition methods
- A non-binary constraint ordering heuristic for constraint satisfaction problems
- Interleaving solving and elicitation of constraint satisfaction problems based on expected cost
- Constraint relaxation may be perfect
- A new tractable class of constraint satisfaction problems
- Tractable reasoning via approximation
- Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search
- A tabu search approach to the constraint satisfaction problem as a general problem solver
- Dynamic variable ordering in graph based backjumping algorithms for csps
- High-order consistency in valued constraint satisfaction
- Constraint solving for proof planning
- Integer programs for logic constraint satisfaction
- On computing minimal models
- scientific article; zbMATH DE number 4049150 (Why is no real title available?)
- Tree clustering for constraint networks
- Partition search for non-binary constraint satisfaction
- Domain permutation reduction for constraint satisfaction problems
- Semiring induced valuation algebras: exact and approximate local computation algorithms
- Tractable constraints on ordered domains
- Linear-programming design and analysis of fast algorithms for Max 2-CSP
- The complexity of reasoning with global constraints
- An optimal coarse-grained arc consistency algorithm
- A general scheme for automatic generation of search heuristics from specification \(dependencies^{*}\)
- The job shop scheduling problem: Conventional and new solution techniques
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)
