| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A concise characterization of strong knapsack facets
|
Chopra, Sunil
|
|
2019
|
253 |
C |
p. 136-152
|
artikel
|
| 2 |
A Gram classification of principal Cox-regular edge-bipartite graphs via inflation algorithm
|
Makuracki, Bartosz
|
|
2019
|
253 |
C |
p. 25-36
|
artikel
|
| 3 |
An Adaptive Large Neighborhood Search for relocating vehicles in electric carsharing services
|
Bruglieri, Maurizio
|
|
2019
|
253 |
C |
p. 185-200
|
artikel
|
| 4 |
A polynomial recognition of unit forms using graph-based strategies
|
Alves, Jesmmer
|
|
2019
|
253 |
C |
p. 61-72
|
artikel
|
| 5 |
Augmenting the algebraic connectivity for certain families of graphs
|
Justel, Claudia
|
|
2019
|
253 |
C |
p. 51-60
|
artikel
|
| 6 |
Computing a minimum paired-dominating set in strongly orderable graphs
|
Pradhan, D.
|
|
2019
|
253 |
C |
p. 37-50
|
artikel
|
| 7 |
Editorial Board
|
|
|
2019
|
253 |
C |
p. ii
|
artikel
|
| 8 |
Empirical analysis of algorithms for the shortest negative cost cycle problem
|
Anderson, Matthew
|
|
2019
|
253 |
C |
p. 167-184
|
artikel
|
| 9 |
Executing bigraphical reactive systems
|
Gassara, Amal
|
|
2019
|
253 |
C |
p. 73-92
|
artikel
|
| 10 |
Gaussian random projections for Euclidean membership problems
|
Vu, Ky
|
|
2019
|
253 |
C |
p. 93-102
|
artikel
|
| 11 |
New exact approaches and approximation results for the Penalized Knapsack Problem
|
Della Croce, Federico
|
|
2019
|
253 |
C |
p. 122-135
|
artikel
|
| 12 |
On the chromatic number of 2 K 2 -free graphs
|
Brause, Christoph
|
|
2019
|
253 |
C |
p. 14-24
|
artikel
|
| 13 |
On the P 3 -hull number of some products of graphs
|
Coelho, Erika M.M.
|
|
2019
|
253 |
C |
p. 2-13
|
artikel
|
| 14 |
Polynomial and pseudo-polynomial time algorithms for different classes of the Distance Critical Node Problem
|
Aringhieri, Roberto
|
|
2019
|
253 |
C |
p. 103-121
|
artikel
|
| 15 |
14th Cologne-Twente Workshop on Graphs and CombinatorialOptimization (CTW 2016)
|
Ceselli, Alberto
|
|
2019
|
253 |
C |
p. 1
|
artikel
|
| 16 |
The matching relaxation for a class of generalized set partitioning problems
|
Samer, Phillippe
|
|
2019
|
253 |
C |
p. 153-166
|
artikel
|
Tijdschrift beschrijving