| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs
|
Wang, Weifan
|
|
2015
|
65 |
2 |
p. 351-367
|
artikel
|
| 2 |
Dynamic programming approximation algorithms for the capacitated lot-sizing problem
|
Büyüktahtakın, İ. Esra
|
|
2015
|
65 |
2 |
p. 231-259
|
artikel
|
| 3 |
Extended reverse-convex programming: an approximate enumeration approach to global optimization
|
Bunin, Gene A.
|
|
2015
|
65 |
2 |
p. 191-229
|
artikel
|
| 4 |
Global behavior of the Douglas–Rachford method for a nonconvex feasibility problem
|
Aragón Artacho, Francisco J.
|
|
2015
|
65 |
2 |
p. 309-327
|
artikel
|
| 5 |
Heuristics for exact nonnegative matrix factorization
|
Vandaele, Arnaud
|
|
2015
|
65 |
2 |
p. 369-400
|
artikel
|
| 6 |
Irregular polyomino tiling via integer programming with application in phased array antenna design
|
Karademir, Serdar
|
|
2015
|
65 |
2 |
p. 137-173
|
artikel
|
| 7 |
Numerical approximation of the solution in infinite dimensional global optimization using a representation formula
|
Zidani, H.
|
|
2015
|
65 |
2 |
p. 261-281
|
artikel
|
| 8 |
On Slater’s condition and finite convergence of the Douglas–Rachford algorithm for solving convex feasibility problems in Euclidean spaces
|
Bauschke, Heinz H.
|
|
2015
|
65 |
2 |
p. 329-349
|
artikel
|
| 9 |
Quasi-phi-functions and optimal packing of ellipses
|
Stoyan, Y.
|
|
2015
|
65 |
2 |
p. 283-307
|
artikel
|
| 10 |
Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets
|
Jeyakumar, V.
|
|
2015
|
65 |
2 |
p. 175-190
|
artikel
|
Tijdschrift beschrijving