no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
1 |
An approximation algorithm for the Euclidean incremental median problem
|
Shenmaier, Vladimir |
|
2016 |
22 |
PB |
p. 312-327 16 p. |
article |
2 |
Approximating the k -splittable capacitated network design problem
|
Morsy, Ehab |
|
2016 |
22 |
PB |
p. 328-340 13 p. |
article |
3 |
Blocking unions of arborescences
|
BernĂ¡th, Attila |
|
2016 |
22 |
PB |
p. 277-290 14 p. |
article |
4 |
Constrained domatic bipartition on trees
|
Andreatta, Giovanni |
|
2016 |
22 |
PB |
p. 372-388 17 p. |
article |
5 |
Duality for a b -complementary multisemigroup master problem
|
Madriz Lozada, Eleazar |
|
2016 |
22 |
PB |
p. 364-371 8 p. |
article |
6 |
Editorial Board
|
|
|
2016 |
22 |
PB |
p. IFC- 1 p. |
article |
7 |
Fathoming rules for biobjective mixed integer linear programs: Review and extensions
|
Belotti, Pietro |
|
2016 |
22 |
PB |
p. 341-363 23 p. |
article |
8 |
Integer programming as projection
|
Williams, H.P. |
|
2016 |
22 |
PB |
p. 291-311 21 p. |
article |
9 |
On the complexity of Wafer-to-Wafer Integration
|
Bougeret, M. |
|
2016 |
22 |
PB |
p. 255-269 15 p. |
article |
10 |
On the k -limited packing numbers in graphs
|
Samadi, Babak |
|
2016 |
22 |
PB |
p. 270-276 7 p. |
article |