Digitale Bibliotheek
Sluiten Bladeren door artikelen uit een tijdschrift
     Tijdschrift beschrijving
       Alle jaargangen van het bijbehorende tijdschrift
         Alle afleveringen van het bijbehorende jaargang
                                       Alle artikelen van de bijbehorende aflevering
 
                             43 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 A branch and price approach for the Split Pickup and Split Delivery VRP Casazza, Marco
2018
69 C p. 189-196
artikel
2 A heuristic Approach for the k-Traveling Repairman Problem with Profits under Uncertainty Bruni, M.E.
2018
69 C p. 221-228
artikel
3 A hybrid heuristic for the multi-activity tour scheduling problem Pan, Stefania
2018
69 C p. 333-340
artikel
4 Algorithms, pseudo-codes, implementations – some reflections on interdependencies and potential implications Geiger, Martin Josef
2018
69 C p. 37-44
artikel
5 A MILP formulation for a tire curing scheduling problem Cancela, Héctor
2018
69 C p. 61-68
artikel
6 A mixed-integer linear optimization model for a two-echelon agribusiness supply chain Albornoz, Víctor M.
2018
69 C p. 253-260
artikel
7 An Approximation Algorithm for the Two-Node-Connected Star Problem with Steiner Nodes Ferreira, Graciela
2018
69 C p. 173-180
artikel
8 An Evolutionary Algorithm for Automatic Recommendation of Clustering Methods and its Parameters Carballido, Jessica A.
2018
69 C p. 229-236
artikel
9 An integer linear programming model for the constrained shortest path tour problem de Andrade, Rafael Castro
2018
69 C p. 141-148
artikel
10 Applying Algorithm Selection – a Case Study for the Generalised Assignment Problem Degroote, Hans
2018
69 C p. 205-212
artikel
11 A Price-and-Branch algorithm for a drayage problem with heterogeneous trucks Ghezelsoflu, Ali
2018
69 C p. 237-244
artikel
12 Average Longest Path and Maximum Cost Network Flows with Multiple-Criteria Weights Jordan, Jeremy D.
2018
69 C p. 181-188
artikel
13 Biclustering as Strategy for Improving Feature Selection in Consensus QSAR Modeling Martínez, María Jimena
2018
69 C p. 117-124
artikel
14 Characterization by forbidden induced subgraphs of some subclasses of chordal graphs Nogueira, Sérgio H.
2018
69 C p. 77-84
artikel
15 Chordal-(2,1) graph sandwich problem with boundary conditions Couto, Fernanda
2018
69 C p. 277-284
artikel
16 Closure of genomic sets: applications of graph convexity to genome rearrangement problems Cunha, Luís
2018
69 C p. 285-292
artikel
17 Comparison of Multiobjective Evolutionary Algorithms for Prioritized Urban Waste Collection in Montevideo, Uruguay Nesmachnow, Sergio
2018
69 C p. 93-100
artikel
18 Computational evaluation of ranking models in an automatic decomposition framework Basso, Saverio
2018
69 C p. 245-252
artikel
19 Cross-identification of stellar catalogs with multiple stars: Complexity and Resolution Severín, Daniel
2018
69 C p. 29-36
artikel
20 Designing Pedibus Lines: a Path Based Approach Malucelli, Federico
2018
69 C p. 149-156
artikel
21 Ex post evaluation of an operating theatre Aringhieri, Roberto
2018
69 C p. 157-164
artikel
22 Green Vehicle Routing and Scheduling Problem with Split Delivery Sousa Matos, Marcos Raylan
2018
69 C p. 13-20
artikel
23 Heuristics for the Minimum Broadcast Time de Sousa, Amaro
2018
69 C p. 165-172
artikel
24 Integer programming formulations for the time-dependent elementary shortest path problem with resource constraints Lera-Romero, Gonzalo
2018
69 C p. 53-60
artikel
25 Maintenance on the Railway Network: Disruptions and re-scheduling Deleplanque, Samuel
2018
69 C p. 109-116
artikel
26 Modelling 3-Coloring of Outerplanar Graphs via Incremental Satisfiability De Ita Luna, Guillermo
2018
69 C p. 101-108
artikel
27 Models and cutting-plane strategies for the tree-star problem Andrade, Rafael
2018
69 C p. 261-268
artikel
28 On a Stackelberg Subset Sum Game Pferschy, Ulrich
2018
69 C p. 133-140
artikel
29 On the Chvátal-rank of facets for the set covering polyhedron of circular matrices Nasini, Graciela
2018
69 C p. 85-92
artikel
30 On the complexity of a Virtual Network Function Placement and Routing problem Addis, Bernardetta
2018
69 C p. 197-204
artikel
31 Optimization of transition rules in a Bonus-Malus system Gyetvai, Márton
2018
69 C p. 5-12
artikel
32 Order Batching and Routing in a Non-Standard Warehouse Pferschy, Ulrich
2018
69 C p. 125-132
artikel
33 Preface Cacchiani, Valentina
2018
69 C p. 1-3
artikel
34 Review of Dynamic Stability Metrics and a Mechanical Model Integrated with Open Source Tools for the Container Loading Problem Martínez, Juan Camilo
2018
69 C p. 325-332
artikel
35 Robust Train Timetabling and Stop Planning with Uncertain Passenger Demand Qi, Jianguo
2018
69 C p. 213-220
artikel
36 Self-sufficient sets in smartgrids David, J.
2018
69 C p. 301-308
artikel
37 Shortest Path Problem variants for the Hydro Unit Commitment Problem van Ackooij, Wim
2018
69 C p. 309-316
artikel
38 The Dominance Flow Shop Scheduling Problem Rossit, Daniel A.
2018
69 C p. 21-28
artikel
39 The Interference-aware Drone Ad-hoc Relay Network Configuration problem De Francesco, Carla
2018
69 C p. 317-324
artikel
40 The knapsack problem with scheduled items Díaz-Núñez, Fabián
2018
69 C p. 293-300
artikel
41 The Single Polybag Loading Problem Che, Yuxin
2018
69 C p. 69-76
artikel
42 Towards Robust Admission Control in Delay-Constrained Routing Problems Frangioni, Antonio
2018
69 C p. 45-52
artikel
43 Unconstraining the Passenger Demand for Rail Yield Management at Trenitalia Berto, Alessandra
2018
69 C p. 269-276
artikel
                             43 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland