nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Accelerated sampling Kaczmarz Motzkin algorithm for the linear feasibility problem
|
Morshed, Md Sarowar |
|
|
77 |
2 |
p. 361-382 |
artikel |
2 |
An enhanced formulation for solving graph coloring problems with the Douglas–Rachford algorithm
|
Aragón Artacho, Francisco J. |
|
|
77 |
2 |
p. 383-403 |
artikel |
3 |
An exact completely positive programming formulation for the discrete ordered median problem: an extended version
|
Puerto, J. |
|
|
77 |
2 |
p. 341-359 |
artikel |
4 |
Approximation algorithms for capacitated partial inverse maximum spanning tree problem
|
Li, Xianyue |
|
|
77 |
2 |
p. 319-340 |
artikel |
5 |
Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem
|
Dey, Santanu S. |
|
|
77 |
2 |
p. 227-272 |
artikel |
6 |
Globally minimizing the sum of a convex–concave fraction and a convex function based on wave-curve bounds
|
Xia, Yong |
|
|
77 |
2 |
p. 301-318 |
artikel |
7 |
Linear conditioning, weak sharpness and finite convergence for equilibrium problems
|
Van Nguyen, Luong |
|
|
77 |
2 |
p. 405-424 |
artikel |
8 |
New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm
|
Paulavičius, R. |
|
|
77 |
2 |
p. 197-225 |
artikel |
9 |
Order cancellation law in the family of bounded convex sets
|
Grzybowski, J. |
|
|
77 |
2 |
p. 289-300 |
artikel |
10 |
Sequential characterizations of approximate solutions in convex vector optimization problems with set-valued maps
|
Sisarat, Nithirat |
|
|
77 |
2 |
p. 273-287 |
artikel |