| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A branch-cut-and-price algorithm for optimal decoding in digital communication systems
|
Kabakulak, Banu
|
|
|
81 |
3 |
p. 805-834
|
artikel
|
| 2 |
A dual approach to multi-dimensional assignment problems
|
Li, Jingqun
|
|
|
81 |
3 |
p. 691-716
|
artikel
|
| 3 |
A modified simplex partition algorithm to test copositivity
|
Safi, Mohammadreza
|
|
|
81 |
3 |
p. 645-658
|
artikel
|
| 4 |
An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron
|
Chen, Liang
|
|
|
81 |
3 |
p. 659-689
|
artikel
|
| 5 |
An objective penalty function method for biconvex programming
|
Meng, Zhiqing
|
|
|
81 |
3 |
p. 599-620
|
artikel
|
| 6 |
Detecting optimality and extracting solutions in polynomial optimization with the truncated GNS construction
|
Quijorna, María López
|
|
|
81 |
3 |
p. 559-598
|
artikel
|
| 7 |
Dual-density-based reweighted ℓ1-algorithms for a class of ℓ0-minimization problems
|
Xu, Jialiang
|
|
|
81 |
3 |
p. 749-772
|
artikel
|
| 8 |
Exclusion regions for parameter-dependent systems of equations
|
Ponleitner, Bettina
|
|
|
81 |
3 |
p. 621-644
|
artikel
|
| 9 |
Improved interval methods for solving circle packing problems in the unit square
|
Markót, Mihály Csaba
|
|
|
81 |
3 |
p. 773-803
|
artikel
|
| 10 |
Nonconvex and Nonsmooth Sparse Optimization via Adaptively Iterative Reweighted Methods
|
Wang, Hao
|
|
|
81 |
3 |
p. 717-748
|
artikel
|
Tijdschrift beschrijving