Optimization problems with interval uncertainty: branch and bound method

DOI10.1007/S10559-013-9554-8zbMath1309.90091OpenAlexW1996474302MaRDI QIDQ465982

O. O. Iemets, Ol. O. Yemets, Ivan V. Sergienko

Publication date: 24 October 2014

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-013-9554-8

zbMATH Keywords

optimizationinterval uncertaintybranch and bound method

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (4)

Formal model of the synthesized screen image of a dynamic situation in areas of monitoring mobile objects and its implementation in a web-oriented geoinformation system ⋮ Properties of the linear unconditional problem of combinatorial optimization on arrangements under probabilistic uncertainty ⋮ Optimization problems with interval uncertainty: branch and bound method ⋮ Combinatorial optimization model of packing rectangles with stochastic parameters

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization problems with interval uncertainty: branch and bound method
• Combinatorial optimization under uncertainty

This page was built for publication: Optimization problems with interval uncertainty: branch and bound method