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
10 results found
no
title
author
magazine
year
volume
issue
page(s)
type
1
Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem
Clautiaux, François
29
C
p. 18-44
article
2
Complete formulations of polytopes related to extensions of assignment matrices
Ben-Ameur, Walid
29
C
p. 133-147
article
3
Editorial Board
29
C
p. ii
article
4
From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints
Porumbel, Daniel
29
C
p. 148-173
article
5
Pareto optimal matchings of students to courses in the presence of prerequisites
Cechlárová, Katarína
29
C
p. 174-195
article
6
Staircase compatibility and its applications in scheduling and piecewise linearization
Bärmann, Andreas
29
C
p. 111-132
article
7
The computational complexity of dominating set problems for instances with bounded minors of constraint matrices
Malyshev, D.S.
29
C
p. 103-110
article
8
The skiving stock problem and its relation to hypergraph matchings
Martinovic, J.
29
C
p. 77-102
article
9
Upgrading the 1-center problem with edge length variables on a tree
Sepasian, Ali Reza
29
C
p. 1-17
article
10
Upper bound on 3-rainbow domination in graphs with minimum degree 2
Furuya, Michitaka
29
C
p. 45-76
article
10 results found
Koninklijke Bibliotheek -
National Library of the Netherlands