Combinatorial optimization under uncertainty
From MaRDI portal
Publication:1008321
DOI10.1007/s10559-008-9035-7zbMath1157.90519OpenAlexW2036974767MaRDI QIDQ1008321
Publication date: 27 March 2009
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-008-9035-7
Stochastic programming (90C15) Combinatorial optimization (90C27) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70)
Related Items (4)
Properties of the linear unconditional problem of combinatorial optimization on arrangements under probabilistic uncertainty ⋮ Theory and methods of Euclidian combinatorial optimization: current status and prospects ⋮ Optimization problems with interval uncertainty: branch and bound method ⋮ Combinatorial optimization model of packing rectangles with stochastic parameters
Cites Work
- A modification of the method of combinatorial truncation in optimization problems over vertex-located sets
- Stability of a vector integer quadratic programming problem with respect to vector criterion and constraints
- Solving optimization problems with linear-fractional objective functions and additional constraints on the arrangements
- Linear variational principle for convex vector maximization
- Using a model of cellular automata and classification methods for prediction of time series with memory
- Stability of a combinatorial vector partition problemcategory:Brief communications
- A fuzzy problem of multiparametric choice of optimal solutions
- Existence of solutions in vector optimization problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Combinatorial optimization under uncertainty