The following pages link to Backtrack Programming (Q5514130):
Displaying 50 items.
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects (Q312490) (← links)
- Weak Schur numbers and the search for G. W. Walker's lost partitions (Q418311) (← links)
- Dominance rules in combinatorial optimization problems (Q421551) (← links)
- A constraint propagation approach to structural model based image segmentation and recognition (Q497274) (← links)
- Semantic-based regularization for learning and inference (Q511774) (← links)
- Global optimization numerical strategies for rate-independent processes (Q540696) (← links)
- A logic language for combinatorial optimization (Q918429) (← links)
- 2-Covered paths by a set of antennas with minimum power transmission range (Q989482) (← links)
- Using matrices to link conflict evolution and resolution in a graph model (Q992610) (← links)
- Classification of simple 2-(11,3,3) designs (Q1011489) (← links)
- Avoiding squares and overlaps over the natural numbers (Q1045019) (← links)
- A backtracking method for constructing perfect hash functions from a set of mapping functions (Q1059411) (← links)
- On generalized Steiner systems and semi-biplanes (Q1060416) (← links)
- A fast backtrack algorithm for graph isomorphism (Q1106855) (← links)
- A note on extending Knuth's tree estimator to directed acyclic graphs (Q1108027) (← links)
- On the number of transitive digraphs with n labeled vertices and k arcs (Q1155069) (← links)
- An effective structured approach to finding optimal partitions of networks (Q1164549) (← links)
- Linear congruence equations for the solutions of the \(N\)-queens problem (Q1197990) (← links)
- Construction of vector lists and isomorph rejection (Q1227621) (← links)
- Backtracking in recursive computations (Q1238623) (← links)
- A structured program to generate all topological sorting arrangements (Q1393277) (← links)
- Backtracking algorithms for disjunctions of temporal constraints (Q1575430) (← links)
- Backjump-based backtracking for constraint satisfaction problems (Q1605408) (← links)
- Optimal 2-coverage of a polygonal region in a sensor network (Q1662495) (← links)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- Backtrack search with isomorph rejection and consistency check (Q1825676) (← links)
- On forward checking for non-binary constraint satisfaction. (Q1852854) (← links)
- Pruning the search tree in the constructive enumeration of molecular graphs (Q1917340) (← links)
- A new branch-and-filter exact algorithm for binary constraint satisfaction problems (Q2077912) (← links)
- Partition search for non-binary constraint satisfaction (Q2372239) (← links)
- Staffing a software project: A constraint satisfaction and optimization-based approach (Q2482363) (← links)
- REF-ARF: A system for solving problems stated as procedures (Q2541849) (← links)
- The combinatorial analysis of patterns and the principle of inclusion- exclusion (Q2554328) (← links)
- An empirical study of phase transitions in binary constraint satisfaction problems (Q2674179) (← links)
- On the classification of Hadamard matrices of order 32 (Q3057079) (← links)
- A new mathematical model for tiling finite regions of the plane with polyominoes (Q3303533) (← links)
- Preventing redundant solutions in partial enumeration algorithms (Q4181287) (← links)
- Theoretical comparisons of search strategies in branch-and-bound algorithms (Q4192964) (← links)
- Constraint Satisfaction (Q4452903) (← links)
- A survey of bounds for classical Ramsey numbers (Q4745846) (← links)
- Connecting Red Cells in a Bicolour Voronoi Diagram (Q4899279) (← links)
- Hadamard Matrices of Order 32 (Q4929251) (← links)
- Schur numbers involving rainbow colorings (Q4988853) (← links)
- Enumerating diagonal Latin squares of order up to 9 (Q5212149) (← links)
- ELEMENTARY p-GROUPS WITH THE RÉDEI PROPERTY (Q5292272) (← links)
- (Q5383241) (← links)
- On Some Open Questions for Ramsey and Folkman Numbers (Q5506775) (← links)
- Tree-search algorithms for quadratic assignment problems (Q5620476) (← links)
- (Q5659341) (← links)
- An integer linear programming approach to solving the Eternity puzzle (Q6076354) (← links)