Probabilistic subproblem selection in branch-and-bound algorithms

DOI10.1016/J.CAM.2004.10.019zbMATH Open1078.65050OpenAlexW2011054152MaRDI QIDQ557739FDOQ557739

Authors: Mirjam Dür, Volker Stix 

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

Recommendations

• scientific article; zbMATH DE number 3892936
• Target-oriented branch and bound method for global optimization
• On the selection of subdivision directions in interval branch-and-bound methods for global optimization
• Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds
• A new node selection strategy in the branch-and-bound procedure

zbMATH Keywords

numerical experimentsConvergenceNonconvex programmingSubset selection in branch-and-bound algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)

Cites Work

• An Algorithm for the Traveling Salesman Problem
• Title not available (Why is that?)
• A branch and bound method for stochastic global optimization
• A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
• New subinterval selection criteria for interval global optimization
• Probability theory. Translated from the German by Robert B. Burckel
• An optimization model for the simultaneous operational flight and pilot scheduling problem
• Title not available (Why is that?)
• A branch-and-bound algorithm for the location of facilities causing atmospheric pollution
• A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method
• 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
• Dual bounding procedures lead to convergent branch-and-bound algorithms
• Theoretical justification of a heuristic subbox selection criterion for interval global optimization

Cited In (3)

• P-algorithm based on a simplicial statistical model of multimodal functions
• Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds
• Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning

Uses Software

• DIMACS

This page was built for publication: Probabilistic subproblem selection in branch-and-bound algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q557739)