Digitale Bibliotheek
Sluiten Bladeren door artikelen uit een tijdschrift
 
Zoeken naar met titel:
ABCDEFGHIJKLMNOPQRSTUVWXYZ

     Tijdschrift beschrijving
       Alle jaargangen van het bijbehorende tijdschrift
         Alle afleveringen van het bijbehorende jaargang
                                       Alle artikelen van de bijbehorende aflevering
 
                             48 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 A Branch-and-cut-and-price algorithm for the Stackelberg Minimum Spanning Tree Game Morais, Vinicius
 2016
 52 C p. 309-316
8 p.
 artikel
2 A branch-and-price based heuristic for the stochastic vehicle routing problem with hard time windows Andreatta, G.
 2016
 52 C p. 325-332
8 p.
 artikel
3 A Compact Linearisation of Euclidean Single Allocation Hub Location Problems Meier, J. Fabian
 2016
 52 C p. 37-44
8 p.
 artikel
4 A Conditional Multi-copy Strategy with Multiple Central Nodes for More Secure Wireless Sensor Networks Ekmen, Merve
 2016
 52 C p. 261-268
8 p.
 artikel
5 A Game-theoretic Algorithm for Non-linear Single-Path Routing Problems Vallet, Josselin
 2016
 52 C p. 77-84
8 p.
 artikel
6 A Genetic Algorithm for a class of Critical Node Problems Aringhieri, Roberto
 2016
 52 C p. 359-366
8 p.
 artikel
7 A Hybrid Heuristic based on Iterated Local Search for Multivehicle Inventory Routing Problem Santos, Edcarllos
 2016
 52 C p. 197-204
8 p.
 artikel
8 A Multi-Commodity Flow Based Model for Multi Layer Hierarchical Ring Network Design Schauer, Christian
 2016
 52 C p. 189-196
8 p.
 artikel
9 An Approximation Algorithm for Multiroute Flow Decomposition Suppakitpaisarn, Vorapong
 2016
 52 C p. 367-374
8 p.
 artikel
10 An extended edge-representative formulation for the K-partitioning problem Ales, Zacharie
 2016
 52 C p. 333-342
10 p.
 artikel
11 An Extended Network Interdiction Problem for Optimal Toll Control Borndörfer, Ralf
 2016
 52 C p. 301-308
8 p.
 artikel
12 An Integer L-shaped Method for the Generalized Vehicle Routing Problem with Stochastic Demands Biesinger, Benjamin
 2016
 52 C p. 245-252
8 p.
 artikel
13 A strong symmetric formulation for the Min-degree Constrained Minimum Spanning Tree Problem da Cunha, Alexandre Salles
 2016
 52 C p. 237-244
8 p.
 artikel
14 Benders Decomposition of the Passive Optical Network Design Problem van Loggerenberg, S.P.
 2016
 52 C p. 85-92
8 p.
 artikel
15 Capacitated m Two-Node Survivable Star Problem Bayá, Gabriel
 2016
 52 C p. 253-260
8 p.
 artikel
16 Compressing Two-dimensional Routing Tables with Order Giroire, Frédéric
 2016
 52 C p. 351-358
8 p.
 artikel
17 Differential delay constrained multipath routing for SDN and optical networks Alvizu, Rodolfo
 2016
 52 C p. 277-284
8 p.
 artikel
18 Distributed Monitoring Problem Papadimitriou, Dimitri
 2016
 52 C p. 13-20
8 p.
 artikel
19 Energy-aware survivable networks Addis, Bernardetta
 2016
 52 C p. 133-140
8 p.
 artikel
20 Finding stable flows in multi-agent networks under an equal-sharing policy Chaabane Fakhfakh, Nadia
 2016
 52 C p. 157-164
8 p.
 artikel
21 Grid spanners with low forwarding index for energy efficient networks Giroire, Frederic
 2016
 52 C p. 141-148
8 p.
 artikel
22 Hierarchical Survivable Network Design Problems Rodríguez-Martín, Inmaculada
 2016
 52 C p. 229-236
8 p.
 artikel
23 ILP modelling and joint optimization of anycast and unicast traffic in survivable elastic optical networks Goścień, Róża
 2016
 52 C p. 173-180
8 p.
 artikel
24 Improved compact formulations for metric and cut polyhedra Nguyen, Viet Hung
 2016
 52 C p. 125-132
8 p.
 artikel
25 International Network Optimization Conference, Warsaw, Poland 2015 Pióro, Michał
 2016
 52 C p. 1-3
3 p.
 artikel
26 Lightpath Admission Control in Dynamic Optical Transport Networks de Sousa, Amaro
 2016
 52 C p. 205-212
8 p.
 artikel
27 Location of distribution centers in a multi-period collaborative distribution network Tang, Xin
 2016
 52 C p. 293-300
8 p.
 artikel
28 Lower Bounding Procedures for the Single Allocation Hub Location Problem Rostami, Borzou
 2016
 52 C p. 69-76
8 p.
 artikel
29 Lower Bounding Techniques for DSATUR-based Branch and Bound Furini, Fabio
 2016
 52 C p. 149-156
8 p.
 artikel
30 Mathematical Programming with Stochastic Equilibrium Constraints applied to Optimal Last-mile Delivery Services Tounsi, B.
 2016
 52 C p. 5-12
8 p.
 artikel
31 Maximizing expected number of transplants in kidney exchange programs Alvelos, Filipe
 2016
 52 C p. 269-276
8 p.
 artikel
32 Minimum cost paths over dynamic networks Grande, Enrico
 2016
 52 C p. 343-350
8 p.
 artikel
33 Min-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions Buchheim, Christoph
 2016
 52 C p. 45-52
8 p.
 artikel
34 Models for minimum cost dominating trees Adasme, Pablo
 2016
 52 C p. 101-107
7 p.
 artikel
35 Network Interdiction through Length-Bounded Critical Disruption Paths: a Bi-Objective Approach Granata, Donatella
 2016
 52 C p. 375-382
8 p.
 artikel
36 On packet transmission scheduling for min-max delay and energy consumption in wireless mesh sensor networks Capone, Antonio
 2016
 52 C p. 61-68
8 p.
 artikel
37 On the computational complexity of the virtual network embedding problem Amaldi, Edoardo
 2016
 52 C p. 213-220
8 p.
 artikel
38 Optimal Mapping of Cloud Virtual Machines Guanglei, Wang
 2016
 52 C p. 93-100
8 p.
 artikel
39 Rapid transit network design considering risk aversion Cadarso, Luis
 2016
 52 C p. 29-36
8 p.
 artikel
40 Robust optimisation of green wireless LANs under rate uncertainty and user mobility Garroppo, Rosario G.
 2016
 52 C p. 221-228
8 p.
 artikel
41 Routing hazardous materials by compulsory check points in case of variable demand Cappanera, Paola
 2016
 52 C p. 53-60
8 p.
 artikel
42 Separation Algorithm for Tree Partitioning Inequalities Chopra, Sunil
 2016
 52 C p. 109-116
8 p.
 artikel
43 Smart Meter Tariff Design to Minimise Wholesale Risk Rogers, William
 2016
 52 C p. 21-28
8 p.
 artikel
44 Stochastic nonlinear resource allocation problem Cheng, Jianqiang
 2016
 52 C p. 165-172
8 p.
 artikel
45 Strictly Interval Graphs: Characterization and Linear Time Recognition Markenzon, L.
 2016
 52 C p. 181-188
8 p.
 artikel
46 The k-node connected subgraph problem: Polyhedral analysis and Branch-and-Cut Diarrassouba, Ibrahima
 2016
 52 C p. 117-124
8 p.
 artikel
47 The Tree-Star Problem: A Formulation and a Branch-and-Cut Algorithm Lucena, Abilio
 2016
 52 C p. 285-292
8 p.
 artikel
48 Work-troop scheduling for road network accessibility after a major earthquake Sakuraba, Celso Satoshi
 2016
 52 C p. 317-324
8 p.
 artikel
                             48 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland