Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
From MaRDI portal
Publication:1424768
DOI10.1023/A:1025627211942zbMath1057.68114OpenAlexW1521034429MaRDI QIDQ1424768
Publication date: 15 March 2004
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1025627211942
Related Items
A mixed heuristic for generating cocyclic Hadamard matrices, The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems, Partition search for non-binary constraint satisfaction, Gallai-Edmonds decomposition as a pruning technique, Nature-inspired techniques for dynamic constraint satisfaction problems, Mixed deterministic and probabilistic networks, Min-domain retroactive ordering for asynchronous backtracking, New filtering algorithms for combinations of among constraints, Necessary Conditions for Tractability of Valued CSPs, On the separability of subproblems in Benders decompositions, Generalizing Global Constraints Based on Network Flows, A Global Filtration for Satisfying Goals in Mutual Exclusion Networks, Statistical regimes across constrainedness regions, Dynamic ordering for asynchronous backtracking on DisCSPs, Unnamed Item, Querying Regular Graph Patterns, A logical approach to efficient Max-SAT solving, Symbolic techniques in satisfiability solving, On minimal constraint networks, Concurrent forward bounding for distributed constraint optimization problems, Representing and solving finite-domain constraint problems using systems of polynomials, Obligation as optimal goal satisfaction, Classes of submodular constraints expressible by graph cuts, Discovering implied constraints in precedence graphs with alternatives, Chordal Networks of Polynomial Ideals, Hybrids of Constructive Metaheuristics and Constraint Programming: A Case Study with ACO, Algebras for Tree Decomposable Graphs, Horizontally elastic edge-finder algorithm for cumulative resource constraint revisited, On tree-preserving constraints, Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems, 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, Relational networks of conditional preferences, Efficient algorithms for singleton arc consistency, Graphical models for optimal power flow, STR2: optimized simple tabular reduction for table constraints, On a generalization of ``eight blocks to madness puzzle, Weight-based heuristics for constraint satisfaction and combinatorial optimization problems, Accelerating exact and approximate inference for (distributed) discrete optimization with GPUs, Combining restarts, nogoods and bag-connected decompositions for solving csps, Weight constraint programs with evaluable functions, Data transfer planning with tree placement for collaborative environments, On Sparse Discretization for Graphical Games, Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search, Hybrid Tractable Classes of Constraint Problems, The Broken-Triangle Property with Adjoint Values, Coalition formation in social environments with logic-based agents1, 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, A constraint-based approach for annotating music scores with gestural information, Planning with Incomplete Information, Mendelian error detection in complex pedigrees using weighted constraint satisfaction tech\-niques, Probabilistic TCP-net, Review on nature-inspired algorithms, Popularity-similarity random SAT formulas, A fine-grained arc-consistency algorithm for non-normalized constraint satisfaction problems, Towards constraint-based school timetabling, Towards a practical engineering tool for rostering, Handling fuzzy temporal constraints in a planning environment, Constraint Answer Set Solving, On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers, How to deal with unbelievable assertions, A qualitative dynamical modelling approach to capital accumulation in unregulated fisheries, Lazy Constraint Imposing for Improving the Path Constraint, A complete solution to the maximum density still life problem, Global propagation of side constraints for solving over-constrained problems, A large neighbourhood search approach to the multi-activity shift scheduling problem, Sharpening constraint programming approaches for bit-vector theory, Dynamic temporal decoupling, Unnamed Item, Evaluating the impact of AND/OR search on 0-1 integer linear programming, Accelerating backtrack search with a best-first-search strategy, Propagation via lazy clause generation, Constraint satisfaction problems over semilattice block Mal'tsev algebras, Robust Solutions in Unstable Optimization Problems, A polynomial relational class of binary CSP, 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, Algorithms for finding maximum transitive subtournaments, On Restricted Disjunctive Temporal Problems: Faster Algorithms and Tractability Frontier, Extending Conditional Simple Temporal Networks with Partially Shrinkable Uncertainty., Sufficient and necessary conditions for solution finding in valuation-based systems, Subsumption Algorithms for Three-Valued Geometric Resolution, Exploiting Chordal Structure in Polynomial Ideals: A Gröbner Bases Approach, Minimization of locally defined submodular functions by optimal soft arc consistency, Soft Constraints Processing over Divisible Residuated Lattices, Dismantlability, Connectedness, and Mixing in Relational Structures, HyperConsistency Width for Constraint Satisfaction: Algorithms and Complexity Results, Learning to Integrate Deduction and Search in Reasoning about Quantified Boolean Formulas, MiniBrass: soft constraints for MiniZinc, A Logical Approach to Constraint Satisfaction, Uniform Constraint Satisfaction Problems and Database Theory, Unnamed Item, On the hardness of solving edge matching puzzles as SAT or CSP problems, The Complexity of General-Valued Constraint Satisfaction Problems Seen from the Other Side, Variable and value elimination in binary constraint satisfaction via forbidden patterns, High-order consistency in valued constraint satisfaction, ProCount: weighted projected model counting with graded project-join trees, The algebraic structure of the densification and the sparsification tasks for CSPs, Sequential model-based diagnosis by systematic search, Solving infinite-domain CSPs using the patchwork property
