nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A branch-and-cut algorithm for the maximum k -balanced subgraph of a signed graph
|
Figueiredo, Rosa |
|
2019 |
261 |
C |
p. 164-185 |
artikel |
2 |
A comparison of integer programming models for the partial directed weighted improper coloring problem
|
Hertz, Alain |
|
2019 |
261 |
C |
p. 229-245 |
artikel |
3 |
Broadcast domination and multipacking in strongly chordal graphs
|
Brewster, Richard C. |
|
2019 |
261 |
C |
p. 108-118 |
artikel |
4 |
Certifying coloring algorithms for graphs without long induced paths
|
Kamiński, Marcin |
|
2019 |
261 |
C |
p. 258-267 |
artikel |
5 |
Chronological rectangle digraphs which are two-terminal series–parallel
|
Huang, Jing |
|
2019 |
261 |
C |
p. 246-257 |
artikel |
6 |
Dijkstra graphs
|
Bento, Lucila M.S. |
|
2019 |
261 |
C |
p. 52-62 |
artikel |
7 |
Edge-stable equimatchable graphs
|
Deniz, Zakir |
|
2019 |
261 |
C |
p. 136-147 |
artikel |
8 |
Editorial Board
|
|
|
2019 |
261 |
C |
p. ii |
artikel |
9 |
Equitable coloring of hypergraphs
|
Furmańczyk, Hanna |
|
2019 |
261 |
C |
p. 186-192 |
artikel |
10 |
Equitable total coloring of complete r -partite p -balanced graphs
|
da Silva, A.G. |
|
2019 |
261 |
C |
p. 123-135 |
artikel |
11 |
Flexible flow shop with dedicated buffers
|
Ernst, Andreas |
|
2019 |
261 |
C |
p. 148-163 |
artikel |
12 |
Global edge alliances in graphs
|
Lewoń, Robert |
|
2019 |
261 |
C |
p. 305-315 |
artikel |
13 |
Homomorphism bounds of signed bipartite K 4 -minor-free graphs and edge-colorings of 2 k -regular K 4 -minor-free multigraphs
|
Beaudou, Laurent |
|
2019 |
261 |
C |
p. 40-51 |
artikel |
14 |
Learning Variable Neighborhood Search for a scheduling problem with time windows and rejections
|
Thevenin, Simon |
|
2019 |
261 |
C |
p. 344-353 |
artikel |
15 |
List star edge-coloring of k -degenerate graphs and K 4 -minor free graphs
|
Kerdjoudj, Samia |
|
2019 |
261 |
C |
p. 268-275 |
artikel |
16 |
Minimal obstructions to 2-polar cographs
|
Hell, Pavol |
|
2019 |
261 |
C |
p. 219-228 |
artikel |
17 |
Minimum cost noncrossing flow problem on layered networks
|
Altınel, İ. Kuban |
|
2019 |
261 |
C |
p. 2-21 |
artikel |
18 |
Mixed integer linear programming for feature selection in support vector machine
|
Labbé, Martine |
|
2019 |
261 |
C |
p. 276-304 |
artikel |
19 |
On envy-free perfect matching
|
Arbib, C. |
|
2019 |
261 |
C |
p. 22-27 |
artikel |
20 |
On the thinness and proper thinness of a graph
|
Bonomo, Flavia |
|
2019 |
261 |
C |
p. 78-92 |
artikel |
21 |
Preface: Tenth International Colloquium on Graphs and Optimization (GO X), 2016
|
Crama, Yves |
|
2019 |
261 |
C |
p. 1 |
artikel |
22 |
Proportional and maxmin fairness for the sensor location problem with chance constraints
|
Santos, Marcio C. |
|
2019 |
261 |
C |
p. 316-331 |
artikel |
23 |
Revisiting Lagrangian relaxation for network design
|
Gendron, Bernard |
|
2019 |
261 |
C |
p. 203-218 |
artikel |
24 |
Robust scheduling with budgeted uncertainty
|
Bougeret, Marin |
|
2019 |
261 |
C |
p. 93-107 |
artikel |
25 |
Schedules with a single preemption on uniform parallel machines
|
Soper, Alan J. |
|
2019 |
261 |
C |
p. 332-343 |
artikel |
26 |
Solving the clique cover problem on (bull, C 4 )-free graphs
|
Cameron, Kathie |
|
2019 |
261 |
C |
p. 119-122 |
artikel |
27 |
The Bin Packing Problem with Item Fragmentation:A worst-case analysis
|
Bertazzi, Luca |
|
2019 |
261 |
C |
p. 63-77 |
artikel |
28 |
Timber game as a counting problem
|
Furtado, Ana |
|
2019 |
261 |
C |
p. 193-202 |
artikel |
29 |
Time-dependent asymmetric traveling salesman problem with time windows: Properties and an exact algorithm
|
Arigliano, Anna |
|
2019 |
261 |
C |
p. 28-39 |
artikel |