Relaxations and discretizations for the pooling problem.
- Published in:
- Journal of Global Optimization, 2017, v. 67, n. 3, p. 631, doi. 10.1007/s10898-016-0434-4
- By:
- Publication type:
- Article
Works matching IS 09255001 AND DT 2017 AND VI 67 AND IP 3
Results: 10
1
2
Analysis of budget for interdiction on multicommodity network flows.
- Published in:
- Journal of Global Optimization, 2017, v. 67, n. 3, p. 495, doi. 10.1007/s10898-016-0422-8
- By:
- Publication type:
- Article
3
Branch and bound algorithm with applications to robust stability.
- Published in:
- Journal of Global Optimization, 2017, v. 67, n. 3, p. 553, doi. 10.1007/s10898-016-0424-6
- By:
- Publication type:
- Article
4
A coverage-based Box-Algorithm to compute a representation for optimization problems with three objective functions.
- Published in:
- Journal of Global Optimization, 2017, v. 67, n. 3, p. 581, doi. 10.1007/s10898-016-0425-5
- By:
- Publication type:
- Article
5
Covers and approximations in multiobjective optimization.
- Published in:
- Journal of Global Optimization, 2017, v. 67, n. 3, p. 601, doi. 10.1007/s10898-016-0426-4
- By:
- Publication type:
- Article
6
Heuristic solution approaches for the maximum minsum dispersion problem.
- Published in:
- Journal of Global Optimization, 2017, v. 67, n. 3, p. 671, doi. 10.1007/s10898-016-0429-1
- By:
- Publication type:
- Article
7
Enclosure of all index-1 saddle points of general nonlinear functions.
- Published in:
- Journal of Global Optimization, 2017, v. 67, n. 3, p. 451, doi. 10.1007/s10898-016-0430-8
- By:
- Publication type:
- Article
8
Multiple depot ring star problem: a polyhedral study and an exact algorithm.
- Published in:
- Journal of Global Optimization, 2017, v. 67, n. 3, p. 527, doi. 10.1007/s10898-016-0431-7
- By:
- Publication type:
- Article
9
A polynomially solvable case of the pooling problem.
- Published in:
- Journal of Global Optimization, 2017, v. 67, n. 3, p. 621, doi. 10.1007/s10898-016-0432-6
- By:
- Publication type:
- Article
10
An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints.
- Published in:
- Journal of Global Optimization, 2017, v. 67, n. 3, p. 475, doi. 10.1007/s10898-016-0436-2
- By:
- Publication type:
- Article