| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A Bilevel Programming Model for Proactive Countermeasure Selection in Complex ICT Systems
|
Ridha Mahjoub, A.
|
|
2018
|
64 |
C |
p. 295-304
|
artikel
|
| 2 |
A Branch-and-Bound Algorithm for the Minimum Cost Bipartite Perfect Matching Problem with Conflict Pair Constraints
|
Öncan, Temel
|
|
2018
|
64 |
C |
p. 5-14
|
artikel
|
| 3 |
A Genetic Algorithm for a Green Vehicle Routing Problem
|
de Oliveira da Costa, Paulo Roberto
|
|
2018
|
64 |
C |
p. 65-74
|
artikel
|
| 4 |
A hybrid heuristic for a stochastic production-inventory-routing problem
|
Agra, Agostinho
|
|
2018
|
64 |
C |
p. 345-354
|
artikel
|
| 5 |
A Hybrid Optimization Approach For the Steiner k-Connected Network Design Problem
|
Diarrassouba, Ibrahima
|
|
2018
|
64 |
C |
p. 305-314
|
artikel
|
| 6 |
A network model for routing-fault-free wavelength selection in WRONoCs design
|
Nonato, Maddalena
|
|
2018
|
64 |
C |
p. 285-294
|
artikel
|
| 7 |
An exact algorithm for a multicommodity min-cost flow over time problem
|
Grande, Enrico
|
|
2018
|
64 |
C |
p. 125-134
|
artikel
|
| 8 |
Approximation Hierarchies for the cone of flow matrices
|
Sagnol, Guillaume
|
|
2018
|
64 |
C |
p. 275-284
|
artikel
|
| 9 |
A Sequential Value Correction heuristic for a bi-objective two-dimensional bin-packing
|
Marinelli, Fabrizio
|
|
2018
|
64 |
C |
p. 25-34
|
artikel
|
| 10 |
Bilevel Model for Adaptive Network Flow Problem
|
Baffier, Jean-François
|
|
2018
|
64 |
C |
p. 105-114
|
artikel
|
| 11 |
Budgeted Colored Matching Problems
|
Büsing, Christina
|
|
2018
|
64 |
C |
p. 245-254
|
artikel
|
| 12 |
Column Generation Based Approaches for Combined Routing and Scheduling
|
Ramos, Bruna
|
|
2018
|
64 |
C |
p. 155-164
|
artikel
|
| 13 |
Column generation based primal heuristics for routing and loading problems
|
Pinto, Telmo
|
|
2018
|
64 |
C |
p. 135-144
|
artikel
|
| 14 |
Compact and Extended Formulations for the Virtual Network Embedding Problem
|
Souza, Bráulio A.M.
|
|
2018
|
64 |
C |
p. 205-214
|
artikel
|
| 15 |
Compact Models for Critical Node Detection in Telecommunication Networks
|
Santos, Dorabella
|
|
2018
|
64 |
C |
p. 325-334
|
artikel
|
| 16 |
Computing and maximizing the exact reliability of wireless backhaul networks
|
Coudert, David
|
|
2018
|
64 |
C |
p. 85-94
|
artikel
|
| 17 |
Design of fiber cable tree FTTH networks
|
Angilella, Vincent
|
|
2018
|
64 |
C |
p. 235-244
|
artikel
|
| 18 |
Energy-Efficient Service Function Chain Provisioning
|
Huin, Nicolas
|
|
2018
|
64 |
C |
p. 265-274
|
artikel
|
| 19 |
Formulation and algorithms for the robust maximal covering location problem
|
Coco, Amadeu A.
|
|
2018
|
64 |
C |
p. 145-154
|
artikel
|
| 20 |
Formulations for designing robust networks. An application to wind power collection
|
Bentz, Cédric
|
|
2018
|
64 |
C |
p. 365-374
|
artikel
|
| 21 |
Global Optimization for Scaffolding and Completing Genome Assemblies
|
François, Sebastien
|
|
2018
|
64 |
C |
p. 185-194
|
artikel
|
| 22 |
Green Design of Wireless Local Area Networks by Multiband Robust Optimization
|
D'Andreagiovanni, Fabio
|
|
2018
|
64 |
C |
p. 225-234
|
artikel
|
| 23 |
Ground stations networks for Free-Space Optical communications: maximizing the data transfer
|
Capelle, Mikaël
|
|
2018
|
64 |
C |
p. 255-264
|
artikel
|
| 24 |
ILP Models and Column Generation for the Minimum Sum Coloring Problem
|
Furini, Fabio
|
|
2018
|
64 |
C |
p. 215-224
|
artikel
|
| 25 |
k-Adaptive Routing for the Robust Network Loading Problem
|
Silva, Marco
|
|
2018
|
64 |
C |
p. 95-104
|
artikel
|
| 26 |
Methods for solving road network problems with disruptions
|
Huang, Yipeng
|
|
2018
|
64 |
C |
p. 175-184
|
artikel
|
| 27 |
Minimizing the weighted sum of completion times under processing time uncertainty
|
Ales, Zacharie
|
|
2018
|
64 |
C |
p. 15-24
|
artikel
|
| 28 |
Mixed Integer Linear Programming for new trends in wind farm cable routing
|
Fischetti, Martina
|
|
2018
|
64 |
C |
p. 115-124
|
artikel
|
| 29 |
New Valid Inequalities for the Two-Echelon Capacitated Vehicle Routing Problem
|
Perboli, Guido
|
|
2018
|
64 |
C |
p. 75-84
|
artikel
|
| 30 |
Optimizing allocation in a warehouse network
|
Malaguti, Enrico
|
|
2018
|
64 |
C |
p. 195-204
|
artikel
|
| 31 |
Path Generation for Affine Flow Thinning
|
Pióro, Michał
|
|
2018
|
64 |
C |
p. 355-364
|
artikel
|
| 32 |
Preface
|
Gouveia, Luís
|
|
2018
|
64 |
C |
p. 1-3
|
artikel
|
| 33 |
Redundant Coupling/decoupling in Train Unit Scheduling Optimization
|
Lin, Zhiyuan
|
|
2018
|
64 |
C |
p. 45-54
|
artikel
|
| 34 |
The asymmetric VPN tree problem: polyhedral results and Branch-and-Cut
|
Diarrassouba, Ibrahima
|
|
2018
|
64 |
C |
p. 315-324
|
artikel
|
| 35 |
The Design of Transparent Optical Networks Minimizing the Impact of Critical Nodes
|
Barbosa, Fábio
|
|
2018
|
64 |
C |
p. 165-174
|
artikel
|
| 36 |
The Graph Segmentation Problem
|
Schwartz, Stephan
|
|
2018
|
64 |
C |
p. 35-44
|
artikel
|
| 37 |
Towards Optimal and Scalable Solution for Routing and Spectrum Allocation
|
Enoch, Julian
|
|
2018
|
64 |
C |
p. 335-344
|
artikel
|
| 38 |
Vulnerability of Subclasses of Chordal Graphs
|
Abreu, N.M.M.
|
|
2018
|
64 |
C |
p. 55-63
|
artikel
|
Tijdschrift beschrijving