Probabilistic subproblem selection in branch-and-bound algorithms
From MaRDI portal
Publication:557739
DOI10.1016/j.cam.2004.10.019zbMath1078.65050OpenAlexW2011054152MaRDI QIDQ557739
Publication date: 30 June 2005
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2004.10.019
numerical experimentsConvergenceNonconvex programmingSubset selection in branch-and-bound algorithms
Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Related Items
P-algorithm based on a simplicial statistical model of multimodal functions ⋮ Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning ⋮ Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A branch-and-bound algorithm for the location of facilities causing atmospheric pollution
- A branch and bound method for stochastic global optimization
- A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method
- Probability theory. Translated from the German by Robert B. Burckel
- Target-oriented branch and bound method for global optimization
- Genetic engineering via negative fitness: Evolutionary dynamics for global optimization
- Solving sum-of-ratios fractional programs using efficient points
- A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
- An Optimization Model for the Simultaneous Operational Flight and Pilot Scheduling Problem
- An Algorithm for the Traveling Salesman Problem
- New subinterval selection criteria for interval global optimization
- Dual bounding procedures lead to convergent branch-and-bound algorithms
- Theoretical justification of a heuristic subbox selection criterion for interval global optimization
