Backtrack Programming
From MaRDI portal
Publication:5514130
Cited in
(54)- Weak Schur numbers and the search for G. W. Walker's lost partitions
- Staffing a software project: A constraint satisfaction and optimization-based approach
- Ramsey numbers by stochastic algorithms with new heuristics
- Connecting red cells in a bicolour Voronoi diagram
- Backtracking algorithms for disjunctions of temporal constraints
- A fast backtrack algorithm for graph isomorphism
- A note on extending Knuth's tree estimator to directed acyclic graphs
- Mining frequent itemsets: a perspective from operations research
- scientific article; zbMATH DE number 3390546 (Why is no real title available?)
- Theoretical comparisons of search strategies in branch-and-bound algorithms
- A new mathematical model for tiling finite regions of the plane with polyominoes
- An empirical study of phase transitions in binary constraint satisfaction problems
- Schur numbers involving rainbow colorings
- On some open questions for Ramsey and Folkman numbers
- ELEMENTARY p-GROUPS WITH THE RÉDEI PROPERTY
- Avoiding squares and overlaps over the natural numbers
- Linear congruence equations for the solutions of the N-queens problem
- Constraint reasoning
- 2-Covered paths by a set of antennas with minimum power transmission range
- REF-ARF: A system for solving problems stated as procedures
- Pruning the search tree in the constructive enumeration of molecular graphs
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
- Classification of simple 2-(11,3,3) designs
- On the number of transitive digraphs with n labeled vertices and k arcs
- Optimal 2-coverage of a polygonal region in a sensor network
- An effective structured approach to finding optimal partitions of networks
- An integer linear programming approach to solving the Eternity puzzle
- Partition search for non-binary constraint satisfaction
- Some nonlinear Rado numbers
- Dominance rules in combinatorial optimization problems
- Constraint Satisfaction
- The combinatorial analysis of patterns and the principle of inclusion- exclusion
- A structured program to generate all topological sorting arrangements
- A constraint propagation approach to structural model based image segmentation and recognition
- A logic language for combinatorial optimization
- Preventing redundant solutions in partial enumeration algorithms
- A backtracking method for constructing perfect hash functions from a set of mapping functions
- On generalized Steiner systems and semi-biplanes
- Tree-search algorithms for quadratic assignment problems
- A survey of bounds for classical Ramsey numbers
- Global optimization numerical strategies for rate-independent processes
- Backtracking in recursive computations
- Using matrices to link conflict evolution and resolution in a graph model
- Backjump-based backtracking for constraint satisfaction problems
- Hadamard matrices of order 32
- On the observable restrictions of limited consideration models: theory and application
- A new branch-and-filter exact algorithm for binary constraint satisfaction problems
- Semantic-based regularization for learning and inference
- Backtrack search with isomorph rejection and consistency check
- Enumerating diagonal Latin squares of order up to 9
- On forward checking for non-binary constraint satisfaction.
- On the classification of Hadamard matrices of order 32
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- Construction of vector lists and isomorph rejection
This page was built for publication: Backtrack Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5514130)