Pages that link to "Item:Q858332"
From MaRDI portal
The following pages link to Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness'' information (Q858332):
Displayed 5 items.
- Improved branching disjunctions for branch-and-bound: an analytic center approach (Q319920) (← links)
- Stochastic level-value approximation for quadratic integer convex programming (Q940660) (← links)
- Using modifications to Grover's search algorithm for quantum global optimization (Q992656) (← links)
- Variable neighborhood search heuristics for selecting a subset of variables in principal component analysis (Q1048653) (← links)
- (Q4577935) (← links)