Adaptive discretization-based algorithms for semi-infinite programs with unbounded variables.
- Published in:
- Mathematical Methods of Operations Research, 2022, v. 96, n. 1, p. 83, doi. 10.1007/s00186-022-00792-y
- By:
- Publication type:
- Article
Works matching IS 14322994 AND DT 2022 AND VI 96 AND IP 1
Results: 6
1
2
On the rectangular knapsack problem.
- Published in:
- Mathematical Methods of Operations Research, 2022, v. 96, n. 1, p. 149, doi. 10.1007/s00186-022-00788-8
- By:
- Publication type:
- Article
3
Approximations for Pareto and Proper Pareto solutions and their KKT conditions.
- Published in:
- Mathematical Methods of Operations Research, 2022, v. 96, n. 1, p. 123, doi. 10.1007/s00186-022-00787-9
- By:
- Publication type:
- Article
4
The facets of the spanning trees polytope.
- Published in:
- Mathematical Methods of Operations Research, 2022, v. 96, n. 1, p. 113, doi. 10.1007/s00186-022-00786-w
- By:
- Publication type:
- Article
5
Solving continuous set covering problems by means of semi-infinite optimization: With an application in product portfolio optimization.
- Published in:
- Mathematical Methods of Operations Research, 2022, v. 96, n. 1, p. 39, doi. 10.1007/s00186-022-00776-y
- By:
- Publication type:
- Article
6
On the algorithmic solution of optimization problems subject to probabilistic/robust (probust) constraints.
- Published in:
- Mathematical Methods of Operations Research, 2022, v. 96, n. 1, p. 1, doi. 10.1007/s00186-021-00764-8
- By:
- Publication type:
- Article