The following pages link to (Q3115678):
Displaying 7 items.
- Estimating the computational complexity of one variant of parallel realization of the branch-and-bound method for the knapsack problem (Q353698) (← links)
- Estimation of the number of iterations in integer programming algorithms using the regular partitions method (Q463771) (← links)
- On estimates of the complexity of numerical characteristics of postoptimality analysis for discrete optimization problems (Q466348) (← links)
- On a lower bound on the computational complexity of a parallel implementation of the branch-and-bound method (Q612225) (← links)
- On the best choice of a branching variable in the subset sum problem (Q1744347) (← links)
- Iterative MC-algorithm to solve the global optimization problems (Q2397267) (← links)
- Complexity of solving the subset sum problem with the branch-and-bound method with domination and cardinality filtering (Q2399471) (← links)
