| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A linearization framework for unconstrained quadratic (0-1) problems
|
Gueye, Serigne
|
|
2009
|
157 |
6 |
p. 1255-1266
12 p.
|
article
|
| 2 |
A Reformulation-Linearization Technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions
|
Sherali, Hanif D.
|
|
2009
|
157 |
6 |
p. 1319-1333
15 p.
|
article
|
| 3 |
A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs
|
da Cunha, Alexandre Salles
|
|
2009
|
157 |
6 |
p. 1198-1217
20 p.
|
article
|
| 4 |
Contents
|
|
|
2009
|
157 |
6 |
p. v-
1 p.
|
article
|
| 5 |
Improved compact linearizations for the unconstrained quadratic 0–1 minimization problem
|
Hansen, Pierre
|
|
2009
|
157 |
6 |
p. 1267-1290
24 p.
|
article
|
| 6 |
Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
|
Billionnet, Alain
|
|
2009
|
157 |
6 |
p. 1185-1197
13 p.
|
article
|
| 7 |
On column generation formulations for the RWA problem
|
Jaumard, B.
|
|
2009
|
157 |
6 |
p. 1291-1308
18 p.
|
article
|
| 8 |
On the choice of explicit stabilizing terms in column generation
|
Ben Amor, Hatem M.T.
|
|
2009
|
157 |
6 |
p. 1167-1184
18 p.
|
article
|
| 9 |
Ranking hypotheses to minimize the search cost in probabilistic inference models
|
Damaschke, Peter
|
|
2009
|
157 |
6 |
p. 1218-1228
11 p.
|
article
|
| 10 |
Reformulation in mathematical programming: An application to quantum chemistry
|
Liberti, Leo
|
|
2009
|
157 |
6 |
p. 1309-1318
10 p.
|
article
|
| 11 |
0–1 reformulations of the multicommodity capacitated network design problem
|
Frangioni, Antonio
|
|
2009
|
157 |
6 |
p. 1229-1241
13 p.
|
article
|
| 12 |
Reformulation techniques in mathematical programming
|
Liberti, Leo
|
|
2009
|
157 |
6 |
p. 1165-1166
2 p.
|
article
|
| 13 |
Rooted k -connections in digraphs
|
Frank, András
|
|
2009
|
157 |
6 |
p. 1242-1254
13 p.
|
article
|
Journal description