Estimating the Efficiency of Backtrack Programs
From MaRDI portal
Cited in
(54)- From feasibility to improvement to proof: three phases of solving mixed-integer programs
- Determining if (FC-) (conflict-directed) backjumping visits a given node is NP-hard
- Holes of the Leech lattice and the projective models of K3 surfaces
- Accelerating backtrack search with a best-first-search strategy
- Polynomial-average-time satisfiability problems
- Enumeration and construction of pandiagonal Latin squares of prime order
- On the existence of an integer solution to the relaxed Weber problem for a tree network
- On learning and branching: a survey
- Estimating the number of vertices of a polyhedron
- Parallel consistent labeling algorithms
- A note on extending Knuth's tree estimator to directed acyclic graphs
- A backtracking algorithm to generate all kernels of a directed graph
- Which algorithm to select in sports timetabling?
- Algorithm runtime prediction: methods \& evaluation
- Estimating the Size of Branch-and-Bound Trees
- A PAC Approach to Application-Specific Algorithm Selection
- On computing small variable disjunction branch-and-bound trees
- Constraint bipartite vertex cover: simpler exact algorithms and implementations
- A Sequential Importance Sampling Algorithm for Counting Linear Extensions
- Network-based heuristics for constraint-satisfaction problems
- Revisiting global constraint satisfaction
- Completeness results for counting problems with easy decision
- Completeness, approximability and exponential time results for counting problems with easy decision version
- Backtracking with multi-level dynamic search rearrangement
- Two backtrack algorithms for the ratio frequency intermodulation problem
- Estimating sizes of social networks via biased sampling
- The Efficiency of an Algorithm of Integer Programming: A Probabilistic Analysis
- Stratified sampling for the Ising model: A graph-theoretic approach
- SelfSplit parallelization for mixed-integer linear programming
- Dynamic variable ordering in graph based backjumping algorithms for csps
- On the estimate of the size of a directed graph
- Approximating the permanent: A simple approach
- Finding and counting permutations via CSPs
- Probabilistic prediction of the complexity of traveling salesman problems based on approximating the complexity distribution from experimental data
- On the classification of APN functions up to dimension five
- On the complexity of finding shortest variable disjunction branch-and-bound proofs
- Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces
- Generating Hamiltonian circuits without backtracking from errors
- On the power of counting the total number of computation paths of NPTMs
- On estimating workload in interval branch-and-bound global optimization algorithms
- A note on Beckett-Gray codes and the relationship of Gray codes to data structures
- Approximately counting embeddings into random graphs
- Stochastic enumeration with importance sampling
- An algorithm for computing the automorphism group of a Hadamard matrix
- The nonexistence of code words of weight 16 in a projective plane of order 10
- The Knuth-Bendix procedure for strings as a substitute for coset enumeration
- Minimal and almost minimal perfect hash function search with application to natural language lexicon design
- Object-oriented backtracking
- The scalability analysis of a parallel tree search algorithm
- Stochastic enumeration method for counting trees
- A clique search problem and its application to machine scheduling
- Predicting optimal solution cost with conditional probabilities
- Quantum-walk speedup of backtracking algorithms
- On a smooth quartic surface containing 56 lines which is isomorphic as a K3 surface to the Fermat quartic
This page was built for publication: Estimating the Efficiency of Backtrack Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4051599)
