Digital Library
Close
Browse articles from a journal
Search for
Magazine
Article
ISSN
NBN article
NBN magazine
DARE/NARCIS document
with title:
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
7 results found
no
title
author
magazine
year
volume
issue
page(s)
type
1
A fully polynomial epsilon approximation cutting plane algorithm for solving combinatorial linear programs containing a sufficiently large ball
Boyd, E.Andrew
1997
20
2
p. 59-63
5 p.
article
2
A new approach to continuation methods for complementarity problems with uniform P-functions
Kanzow, Christian
1997
20
2
p. 85-92
8 p.
article
3
A polynomial approximation scheme for problem F2/r j /C max
Kovalyov, Mikhail Y.
1997
20
2
p. 75-79
5 p.
article
4
On finding two-connected subgraphs in planar graphs
Provan, J.Scott
1997
20
2
p. 81-84
4 p.
article
5
Quadratic resource allocation with generalized upper bounds
Bretthauer, Kurt M.
1997
20
2
p. 51-57
7 p.
article
6
The complexity of scheduling job families about a common due date
Webster, S.T.
1997
20
2
p. 65-74
10 p.
article
7
Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem
Scheithauer, Guntram
1997
20
2
p. 93-100
8 p.
article
7 results found
Koninklijke Bibliotheek -
National Library of the Netherlands