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
 
                             71 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 A branch-and-cut algorithm for the Multiple Steiner TSP with Order constraints Borne, S.
 2013
 41 C p. 487-494
8 p.
 artikel
2 A fast heuristic approach for train timetabling in a railway node Furini, Fabio
 2013
 41 C p. 205-212
8 p.
 artikel
3 A Flow Formulation for the Optimum Communication Spanning Tree Fernández, Elena
 2013
 41 C p. 85-92
8 p.
 artikel
4 A heuristic approach for an integrated fleet-assignment, aircraft-routing and crew-pairing problem Cacchiani, Valentina
 2013
 41 C p. 391-398
8 p.
 artikel
5 A matheuristic approach for solving a home health care problem Allaoua, Hanane
 2013
 41 C p. 471-478
8 p.
 artikel
6 A Network Approach to a Geometric Packing Problem Paynter, Bradley J.
 2013
 41 C p. 295-302
8 p.
 artikel
7 A New Lower Bound for the Kirchhoff Index using a numerical procedure based on Majorization Techniques Cornaro, Alessandra
 2013
 41 C p. 383-390
8 p.
 artikel
8 A new model for multicommodity flow problems, and a strongly polynomial algorithm for single-source Maximum Concurrent Flow Bauguion, Pierre-Olivier
 2013
 41 C p. 311-318
8 p.
 artikel
9 An Extension of a Balanced Flow in a Network Kishimoto, Wataru
 2013
 41 C p. 109-116
8 p.
 artikel
10 An integer fixed-charge multicommodity flow (FCMF) model for train unit scheduling Lin, Zhiyuan
 2013
 41 C p. 165-172
8 p.
 artikel
11 An Interval Assignment Problem for Resource Optimization in LTE Networks Assaad, Mohamad
 2013
 41 C p. 237-244
8 p.
 artikel
12 A planning and routing model for patient transportation in health care Coppi, Alberto
 2013
 41 C p. 125-132
8 p.
 artikel
13 A polyhedral study of the Hamiltonian p-median problem Hupp, Lena
 2013
 41 C p. 213-220
8 p.
 artikel
14 A polynomial formulation for the stochastic maximum weight forest problem Adasme, Pablo
 2013
 41 C p. 29-36
8 p.
 artikel
15 Approximating the Lovász θ Function with the Subgradient Method Giandomenico, Monia
 2013
 41 C p. 157-164
8 p.
 artikel
16 A Study of the Connectivity Over Time Behavior of On-Demand Ad Hoc Path Selection Schemes Raz, David
 2013
 41 C p. 101-108
8 p.
 artikel
17 A Tabu Search Approach for the Prize Collecting Traveling Salesman Problem Pedro, Odivaney
 2013
 41 C p. 261-268
8 p.
 artikel
18 Benders Decomposition for a Location-Design Problem in Green Wireless Local Area Networks Gendron, Bernard
 2013
 41 C p. 367-374
8 p.
 artikel
19 Branch-and-Price for a European variant of the Railroad Blocking Problem Voll, Robert
 2013
 41 C p. 45-52
8 p.
 artikel
20 Capacitated Network Design using Bin-Packing Benhamiche, Amal
 2013
 41 C p. 479-486
8 p.
 artikel
21 Dantzig-Wolfe Reformulation for the Network Pricing Problem with Connected Toll Arcs Fortz, Bernard
 2013
 41 C p. 117-124
8 p.
 artikel
22 Disjunctive combinatorial branch in a subgradient tree algorithm for the DCMST problem with VNS-Lagrangian bounds de Andrade, Rafael Castro
 2013
 41 C p. 5-12
8 p.
 artikel
23 Distributionally robust stochastic shortest path problem Cheng, Jianqiang
 2013
 41 C p. 511-518
8 p.
 artikel
24 Dynamic trees in exterior-point Simplex-type algorithms for network flow problems Geranis, George
 2013
 41 C p. 93-100
8 p.
 artikel
25 Edge Coloring by Total Labelings of 4-regular Circulant Graphs Seba, Hamida
 2013
 41 C p. 141-148
8 p.
 artikel
26 Efficient algorithms for the 2-Way Multi Modal Shortest Path Problem Huguet, Marie-José
 2013
 41 C p. 431-437
7 p.
 artikel
27 Efficient MIP formulation for optimal 1-for-N diversity coding Żotkiewicz, Mateusz
 2013
 41 C p. 133-140
8 p.
 artikel
28 Exact solution for branch vertices constrained spanning problems Massinissa, Merabet
 2013
 41 C p. 527-534
8 p.
 artikel
29 Extended Cutset Inequalities for the Network Power Consumption Problem Koster, Arie
 2013
 41 C p. 69-76
8 p.
 artikel
30 Fitness Landscape Analysis for Scalable Multicast RRM Problem in Cellular Network Xu, Qing
 2013
 41 C p. 407-414
8 p.
 artikel
31 Formulating and Solving the Minimum Dominating Cycle Problem Lucena, Abilio
 2013
 41 C p. 423-430
8 p.
 artikel
32 Formulations for the Minimum 2-Connected Dominating Set Problem do Forte, Vinicius Leal
 2013
 41 C p. 415-422
8 p.
 artikel
33 Heuristics for solving a capacitated multiple allocation hub location problem with application in German wagonload traffic Sender, Julia
 2013
 41 C p. 13-20
8 p.
 artikel
34 Home Care optimization: impact of pattern generation policies on scheduling and routing decisions Cappanera, Paola
 2013
 41 C p. 53-60
8 p.
 artikel
35 Integer programming models for maximizing parallel transmissions in wireless networks Li, Yuan
 2013
 41 C p. 197-204
8 p.
 artikel
36 Intelligent variable neighbourhood search for the minimum labelling spanning tree problem Consoli, S.
 2013
 41 C p. 399-406
8 p.
 artikel
37 2-InterConnected Facility Location: Specification, Complexity, and Exact Solutions Chimani, Markus
 2013
 41 C p. 21-28
8 p.
 artikel
38 International Network Optimization Conference, Tenerife 2013 Hernández-Pérez, Hipólito
 2013
 41 C p. 1-3
3 p.
 artikel
39 Intersecting a simple mixed integer set with a vertex packing set Agra, Agostinho
 2013
 41 C p. 327-334
8 p.
 artikel
40 IP modeling of the survivable hop constrained connected facility location problem Bley, A.
 2013
 41 C p. 463-470
8 p.
 artikel
41 Iterated Local Search for Fiber Installation in Optical Network Optimization dos Reis, Daniel Morais
 2013
 41 C p. 277-284
8 p.
 artikel
42 (k,c) – coloring via Column Generation Malaguti, E.
 2013
 41 C p. 447-454
8 p.
 artikel
43 k-Edge Failure Resilient Network Design Chen, Richard Li-Yang
 2013
 41 C p. 375-382
8 p.
 artikel
44 Load balancing optimization of telecommunication networks with two differentiated services de Sousa, Amaro
 2013
 41 C p. 351-358
8 p.
 artikel
45 Mathematical Analysis of caching policies and cooperation in YouTube-like services Romero, Pablo
 2013
 41 C p. 221-228
8 p.
 artikel
46 Minimizing waiting times in a route design problem with multiple use of a single vehicle Angel-Bello, Francisco
 2013
 41 C p. 269-276
8 p.
 artikel
47 Modeling Earthquake Vulnerability of Highway Networks Arşık, İdil
 2013
 41 C p. 319-326
8 p.
 artikel
48 Multipolar routing: where dynamic and static routing meet Ben-Ameur, Walid
 2013
 41 C p. 61-68
8 p.
 artikel
49 On single-path network routing subject to max-min fair flow allocation Amaldi, Edoardo
 2013
 41 C p. 543-550
8 p.
 artikel
50 On the approximability of two capacitated vehicle routing problems Bock, Adrian
 2013
 41 C p. 519-526
8 p.
 artikel
51 On the Biobjective Adjacent Only Quadratic Spanning Tree Problem Maia, Sílvia M.D.M.
 2013
 41 C p. 535-542
8 p.
 artikel
52 On the Generalized Elementary Shortest Path Problem: A heuristic approach Guerrero, W.J.
 2013
 41 C p. 503-510
8 p.
 artikel
53 On the Hardness of Equal Shortest Path Routing Giroire, Frédéric
 2013
 41 C p. 439-446
8 p.
 artikel
54 On the Two-Architecture Connected Facility Location Problem Leitner, Markus
 2013
 41 C p. 359-366
8 p.
 artikel
55 On the use of multiple sinks to extend the lifetime in connected wireless sensor networks Castaño, F.
 2013
 41 C p. 77-84
8 p.
 artikel
56 Optimal Client-Server Configuration of Mobile Ad-Hoc Networks De Giovanni, Luigi
 2013
 41 C p. 495-502
8 p.
 artikel
57 Optimizing Toll Enforcement in Transportation Networks: a Game-Theoretic Approach Borndörfer, Ralf
 2013
 41 C p. 253-260
8 p.
 artikel
58 Pricing techniques for self regulation in Vehicle Sharing Systems Waserhole, Ariel
 2013
 41 C p. 149-156
8 p.
 artikel
59 Solving the bi-objective prize-collecting Steiner tree problem with the ϵ-constraint method Leitner, Markus
 2013
 41 C p. 181-188
8 p.
 artikel
60 Solving the Passive Optical Network with Fiber Duct Sharing Planning Problem Using Discrete Techniques van Loggerenberg, S.P.
 2013
 41 C p. 343-350
8 p.
 artikel
61 Solving the Two-Stage Robust FTTH network design Problem under Demand Uncertainty Hervet, Cedric
 2013
 41 C p. 335-342
8 p.
 artikel
62 Stochastic Survivable Network Design Problems Ljubić, Ivana
 2013
 41 C p. 245-252
8 p.
 artikel
63 Strategic planning in LTL logistics – increasing the capacity utilization of trucks Fabian Meier, J.
 2013
 41 C p. 37-44
8 p.
 artikel
64 Stronger Lower Bounds for the Quadratic Minimum Spanning Tree Problem with Adjacency Costs Pereira, Dilson Lucas
 2013
 41 C p. 229-236
8 p.
 artikel
65 Team Orienteering Problem with Decreasing Profits Murat Afsar, H.
 2013
 41 C p. 285-293
9 p.
 artikel
66 The cut condition for robust network design Mattia, Sara
 2013
 41 C p. 303-310
8 p.
 artikel
67 The Degree Preserving Spanning Tree Problem: Valid Inequalities and Branch-and-cut method Gendron, Bernard
 2013
 41 C p. 173-180
8 p.
 artikel
68 The final answer to the complexity of a basic problem in resilient network design Tomaszewski, Artur
 2013
 41 C p. 455-462
8 p.
 artikel
69 The track formulation for the Train Dispatching problem Lamorgese, Leonardo
 2013
 41 C p. 559-566
8 p.
 artikel
70 Two Node-Disjoint 3-Hop-Constrained Survivable Network Design and Polyhedra Diarrassouba, Ibrahima
 2013
 41 C p. 551-558
8 p.
 artikel
71 WDM Fiber Replacement Scheduling Bley, Andreas
 2013
 41 C p. 189-196
8 p.
 artikel
                             71 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland