Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Minimization of locally defined submodular functions by optimal soft arc consistency
- A mixed heuristic for generating cocyclic Hadamard matrices
- Obligation as optimal goal satisfaction
- On tree-preserving constraints
- Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems
- Graphical models for optimal power flow
- Accelerating exact and approximate inference for (distributed) discrete optimization with GPUs
- Combining restarts, nogoods and bag-connected decompositions for solving csps
- A complete solution to the maximum density still life problem
- Relational networks of conditional preferences
- Weight-based heuristics for constraint satisfaction and combinatorial optimization problems
- Review on nature-inspired algorithms
- Sharpening constraint programming approaches for bit-vector theory
- Dynamic temporal decoupling
- Accelerating backtrack search with a best-first-search strategy
- ProCount: weighted projected model counting with graded project-join trees
- Nature-inspired techniques for dynamic constraint satisfaction problems
- Popularity-similarity random SAT formulas
- Evaluating the impact of AND/OR search on 0-1 integer linear programming
- Propagation via lazy clause generation
- Constraint satisfaction problems over semilattice block Mal'tsev algebras
- Sufficient and necessary conditions for solution finding in valuation-based systems
- Online control of enumeration strategies via bat algorithm and black hole optimization
- MiniBrass: soft constraints for MiniZinc
- On the hardness of solving edge matching puzzles as SAT or CSP problems
- Variable and value elimination in binary constraint satisfaction via forbidden patterns
- Partition search for non-binary constraint satisfaction
- A logical approach to efficient Max-SAT solving
- Efficient algorithms for singleton arc consistency
- A constraint-based approach for annotating music scores with gestural information
- Towards constraint-based school timetabling
- Towards a practical engineering tool for rostering
- Handling fuzzy temporal constraints in a planning environment
- On global warming: Flow-based soft global constraints
- Bucket elimination for multiobjective optimization problems
- Intelligent variable orderings and re-orderings in DAC-based solvers for WCSP
- Horizontally elastic edge-finder algorithm for cumulative resource constraint revisited
- Exploiting chordal structure in polynomial ideals: a Gröbner bases approach
- Hybrids of Constructive Metaheuristics and Constraint Programming: A Case Study with ACO
- Planning with incomplete information (invited paper)
- Gallai-Edmonds decomposition as a pruning technique
- Querying regular graph patterns
- Probabilistic TCP-net
- Necessary conditions for tractability of valued CSPs
- On minimal constraint networks
- Concurrent forward bounding for distributed constraint optimization problems
- Representing and solving finite-domain constraint problems using systems of polynomials
- Soft Constraints Processing over Divisible Residuated Lattices
- Hyperconsistency width for constraint satisfaction: Algorithms and complexity results
- Learning to integrate deduction and search in reasoning about quantified Boolean formulas
- Block-wise construction of tree-like relational features with monotone reducibility and redundancy
- Creating non-minimal triangulations for use in inference in mixed stochastic/deterministic graphical models
- STR2: optimized simple tabular reduction for table constraints
- scientific article; zbMATH DE number 2080314 (Why is no real title available?)
- Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search
- The Broken-Triangle Property with Adjoint Values
- Constraint Answer Set Solving
- On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers
- Formulating the template ILP consistency problem as a constraint satisfaction problem
- Using dual presolving reductions to reformulate cumulative constraints
- Weighted matching as a generic pruning technique applied to optimization constraints
- Hybrid tractable classes of constraint problems
- The Complexity of General-Valued Constraint Satisfaction Problems Seen from the Other Side
- Extending conditional simple temporal networks with partially shrinkable uncertainty
- On restricted disjunctive temporal problems: faster algorithms and tractability frontier
- Learning qualitative constraint networks
- Dismantlability, Connectedness, and Mixing in Relational Structures
- Algebras for tree decomposable graphs
- On sparse discretization for graphical games
- Coalition formation in social environments with logic-based agents1
- Lazy constraint imposing for improving the path constraint
- Robust Solutions in Unstable Optimization Problems
- Enumerating diagonal Latin squares of order up to 9
- How to deal with unbelievable assertions
- The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems
- Generalizing Global Constraints Based on Network Flows
- A Global Filtration for Satisfying Goals in Mutual Exclusion Networks
- Chordal networks of polynomial ideals
- A fine-grained arc-consistency algorithm for non-normalized constraint satisfaction problems
- Global propagation of side constraints for solving over-constrained problems
- A Logical Approach to Constraint Satisfaction
- Uniform Constraint Satisfaction Problems and Database Theory
- scientific article; zbMATH DE number 2243387 (Why is no real title available?)
- The complexity of conservative valued CSPs
- Algorithms for finding maximum transitive subtournaments
- Classes of submodular constraints expressible by graph cuts
- The algebraic structure of the densification and the sparsification tasks for CSPs
- Sequential model-based diagnosis by systematic search
- Discovering implied constraints in precedence graphs with alternatives
- Solving infinite-domain CSPs using the patchwork property
- Weight constraint programs with evaluable functions
- Data transfer planning with tree placement for collaborative environments
- Consistency, acyclicity, and positive Semirings
- A polynomial relational class of binary CSP
- High-order consistency in valued constraint satisfaction
- Solving connected row convex constraints by variable elimination
- Mixed deterministic and probabilistic networks
- Min-domain retroactive ordering for asynchronous backtracking
- New filtering algorithms for combinations of among constraints
- On the separability of subproblems in Benders decompositions
This page was built for publication: Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1424768)
