Optimization problems with interval uncertainty: branch and bound method

DOI10.1007/S10559-013-9554-8zbMATH Open1309.90091OpenAlexW1996474302MaRDI QIDQ465982FDOQ465982

Authors: I. V. Sergienko, O. O. Iemets, O. O. Yemets' 

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

Recommendations

• Ordering of intervals and optimization problems with interval parameters
• scientific article; zbMATH DE number 852336
• Discrete optimization under interval uncertainty
• Developing interval global optimzation algorithms on the basis of branch-and-bound and constraint propagation methods
• An efficient interval computing technique for bound-constrained uncertain optimization problems

zbMATH Keywords

optimizationbranch and bound methodinterval uncertainty

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Combinatorial optimization under uncertainty
• Optimization problems with interval uncertainty: branch and bound method
• Universal solutions of interval problems in optimization and control
• Title not available (Why is that?)

Cited In (6)

• B\&B method for discrete partial order and quasiorder optimizations
• 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
• Discrete optimization under interval uncertainty

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

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