| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A 2/3-approximation algorithm for vertex-weighted matching
|
Al-Herz, Ahmed
|
|
|
308 |
C |
p. 46-67
|
artikel
|
| 2 |
A polyhedral model for enumeration and optimization over the set of circuits
|
Borgwardt, Steffen
|
|
|
308 |
C |
p. 68-83
|
artikel
|
| 3 |
A PPA parity theorem about trees in a bipartite graph
|
Cameron, Kathie
|
|
|
308 |
C |
p. 107-110
|
artikel
|
| 4 |
Charging station optimization for balanced electric car sharing
|
Deza, Antoine
|
|
|
308 |
C |
p. 187-197
|
artikel
|
| 5 |
Computing the volume of the convex hull of the graph of a trilinear monomial using mixed volumes
|
Speakman, Emily
|
|
|
308 |
C |
p. 36-45
|
artikel
|
| 6 |
Dual-feasible functions for integer programming and combinatorial optimization: Algorithms, characterizations, and approximations
|
Köppe, Matthias
|
|
|
308 |
C |
p. 84-106
|
artikel
|
| 7 |
Editorial Board
|
|
|
|
308 |
C |
p. ii
|
artikel
|
| 8 |
Guessing fractions of online sequences
|
Konrad, Christian
|
|
|
308 |
C |
p. 147-161
|
artikel
|
| 9 |
Insight into the computation of Steiner minimal trees in Euclidean space of general dimension
|
Fampa, Marcia
|
|
|
308 |
C |
p. 4-19
|
artikel
|
| 10 |
Matroid optimization problems with monotone monomials in the objective
|
Fischer, Anja
|
|
|
308 |
C |
p. 20-35
|
artikel
|
| 11 |
Network disconnection games: A game theoretic approach to checkpoint evaluation in networks
|
Baïou, Mourad
|
|
|
308 |
C |
p. 198-208
|
artikel
|
| 12 |
Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design
|
Akhavan Kazemzadeh, Mohammad Rahim
|
|
|
308 |
C |
p. 255-275
|
artikel
|
| 13 |
On convergence of scatter search and star paths with directional rounding for 0–1 mixed integer programs
|
Todosijević, Raca
|
|
|
308 |
C |
p. 235-254
|
artikel
|
| 14 |
On some special classes of contact B 0 -VPG graphs
|
Bonomo-Braberman, Flavia
|
|
|
308 |
C |
p. 111-129
|
artikel
|
| 15 |
On the Lovász–Schrijver PSD-operator on graph classes defined by clique cutsets
|
Wagler, Annegret K.
|
|
|
308 |
C |
p. 209-219
|
artikel
|
| 16 |
Preface: Combinatorial Optimization ISCO 2018
|
Lee, Jon
|
|
|
308 |
C |
p. 1-3
|
artikel
|
| 17 |
Scaling matrices and counting the perfect matchings in graphs
|
Dufossé, Fanny
|
|
|
308 |
C |
p. 130-146
|
artikel
|
| 18 |
Structurally parameterized d -scattered set
|
Katsikarelis, Ioannis
|
|
|
308 |
C |
p. 168-186
|
artikel
|
| 19 |
Student-project allocation with preferences over projects: Algorithmic and experimental results
|
Manlove, David
|
|
|
308 |
C |
p. 220-234
|
artikel
|
| 20 |
The Schrijver system of the flow cone in series–parallel graphs
|
Barbato, Michele
|
|
|
308 |
C |
p. 162-167
|
artikel
|
Tijdschrift beschrijving