Optimization problems with interval uncertainty: branch and bound method
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 3880009 (Why is no real title available?)
- scientific article; zbMATH DE number 3707668 (Why is no real title available?)
- Combinatorial optimization under uncertainty
- Optimization problems with interval uncertainty: branch and bound method
- Universal solutions of interval problems in optimization and control
Cited in
(6)- B\&B method for discrete partial order and quasiorder optimizations
- Properties of the linear unconditional problem of combinatorial optimization on arrangements under probabilistic uncertainty
- 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
- 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)