| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A note on line digraphs and the directed max-cut problem
|
Chvátal, V.
|
|
1990
|
29 |
2-3 |
p. 165-170
6 p.
|
article
|
| 2 |
Author index
|
|
|
1990
|
29 |
2-3 |
p. 263-264
2 p.
|
article
|
| 3 |
Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems
|
Minoux, M.
|
|
1990
|
29 |
2-3 |
p. 195-210
16 p.
|
article
|
| 4 |
Irreducible disjoint covering systems (with an application to boolean algebra)
|
Berger, Marc A.
|
|
1990
|
29 |
2-3 |
p. 143-164
22 p.
|
article
|
| 5 |
Meaningfulness of conclusions from combinatorial optimization
|
Roberts, Fred S.
|
|
1990
|
29 |
2-3 |
p. 221-241
21 p.
|
article
|
| 6 |
On the equivalence of paved-duality and standard linearization in nonlinear 0–1 optimization
|
Hansen, P.
|
|
1990
|
29 |
2-3 |
p. 187-193
7 p.
|
article
|
| 7 |
Preface
|
Hansen, P.
|
|
1990
|
29 |
2-3 |
p. 129-
1 p.
|
article
|
| 8 |
Recognition of a class of unimodular functions
|
Simeone, B.
|
|
1990
|
29 |
2-3 |
p. 243-250
8 p.
|
article
|
| 9 |
The basic algorithm for pseudo-Boolean programming revisited
|
Crama, Yves
|
|
1990
|
29 |
2-3 |
p. 171-185
15 p.
|
article
|
| 10 |
Unconstrained 0–1 optimization and Lagrangean relaxation
|
Adams, Warren E.
|
|
1990
|
29 |
2-3 |
p. 131-142
12 p.
|
article
|
| 11 |
Valid inequalities for 0–1 knapsacks and mips with generalised upper bound constraints
|
Wolsey, Laurence A.
|
|
1990
|
29 |
2-3 |
p. 251-261
11 p.
|
article
|
| 12 |
Vicinal orders of trees
|
Peled, Uri N.
|
|
1990
|
29 |
2-3 |
p. 211-219
9 p.
|
article
|
Journal description