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
 
                             167 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 A bicriteria flow-shop scheduling problem with two serial batching machines Bouzaiene, Afef
 2010
 36 C p. 1177-1184
8 p.
 artikel
2 A Branch-and-Cut Algorithm for the Latent Class Logit Assortment Problem Méndez-Díaz, Isabel
 2010
 36 C p. 383-390
8 p.
 artikel
3 A branch-and-cut approach to the repetition-free longest common subsequence problem Ferreira, Carlos E.
 2010
 36 C p. 527-534
8 p.
 artikel
4 A Branch-and-Price Algorithm for Capacitated Arc Routing Problem with Flexible Time Windows Afsar, H. Murat
 2010
 36 C p. 319-326
8 p.
 artikel
5 A Combined Parallel Lagrangian Decomposition and Cutting-Plane Generation for Maximum Stable Set Problems Campêlo, Manoel
 2010
 36 C p. 503-510
8 p.
 artikel
6 A comparison between lift-and-project indices and imperfection ratio on web graphs Bianchi, S.
 2010
 36 C p. 1081-1088
8 p.
 artikel
7 A computational study for the p-median Problem Elloumi, Sourour
 2010
 36 C p. 455-462
8 p.
 artikel
8 A Computational Study of Lower Bounds for the Two Dimensional Bin Packing Problem Serairi, Mehdi
 2010
 36 C p. 891-897
7 p.
 artikel
9 A Continuous Strategy to Solve a Class of Discrete Optimization Problems Quirino do Nascimento, Roberto
 2010
 36 C p. 279-286
8 p.
 artikel
10 Additive Approximation for Layer Minimization of Manhattan Switchbox Routing Szeszlér, Dávid
 2010
 36 C p. 1097-1104
8 p.
 artikel
11 A Differential Evolution Algorithm for the Winner Determination Problem in Combinatorial Auctions Boughaci, Dalila
 2010
 36 C p. 535-542
8 p.
 artikel
12 A genetic algorithms to solve the bicriteria shortest path problem Mohamed, Cheikh
 2010
 36 C p. 851-858
8 p.
 artikel
13 A heuristic approach to project staffing Walter, Matthias
 2010
 36 C p. 775-782
8 p.
 artikel
14 A Heuristic for an Earth Observing Satellite Constellation Scheduling Problem with Download Considerations Wang, Pei
 2010
 36 C p. 711-718
8 p.
 artikel
15 A 0/1 Integer Programming Model for the Office Space Allocation Problem Ülker, Özgür
 2010
 36 C p. 575-582
8 p.
 artikel
16 Algorithms and formulations for the minimum cut separator problem Ben-Ameur, Walid
 2010
 36 C p. 977-983
7 p.
 artikel
17 A Linear Programming Approach for the Three-Dimensional Bin-Packing Problem Hifi, Mhand
 2010
 36 C p. 993-1000
8 p.
 artikel
18 A Mathematical Model for the Optimization of the Airport Check-In Service Problem Bruno, Giuseppe
 2010
 36 C p. 703-710
8 p.
 artikel
19 A Mixed Integer Model for the Sparsest Cut problem Gourdin, Eric
 2010
 36 C p. 111-118
8 p.
 artikel
20 An Adaptive Scheduling Algorithm for Video Transmission over Wireless Packet Networks Hassan, Mohamed
 2010
 36 C p. 1319-1326
8 p.
 artikel
21 An efficient metaheuristic to improve accessibility by rural road network planning Maya, P.A.
 2010
 36 C p. 631-638
8 p.
 artikel
22 A New Lagrangian Based Branch and Bound Algorithm for the 0-1 Knapsack Problem Salles da Cunha, Alexandre
 2010
 36 C p. 623-630
8 p.
 artikel
23 An exact algorithm for the Minimum Power Multicasting Problem in Wireless Sensor Networks Montemanni, Roberto
 2010
 36 C p. 215-222
8 p.
 artikel
24 An Exact Algorithm for the Steiner Tree Problem with Delays Leggieri, Valeria
 2010
 36 C p. 223-230
8 p.
 artikel
25 An exact method for the bi-objective one-machine problem with maximum lateness and unit family setup cost objectives Artigues, Christian
 2010
 36 C p. 1233-1240
8 p.
 artikel
26 An Exact Site Availability Approach to Modeling the D-FAP Linhares, Andréa Carneiro
 2010
 36 C p. 1-8
8 p.
 artikel
27 An Improved Interior-Point Cutting-Plane Method for Binary Quadratic Optimization Engau, Alexander
 2010
 36 C p. 743-750
8 p.
 artikel
28 An improving dynamic programming algorithm to solve the shortest path problem with time windows Touati Moungla, Nora
 2010
 36 C p. 931-938
8 p.
 artikel
29 An integer programming approach for the time-dependent TSP Miranda-Bront, Juan José
 2010
 36 C p. 351-358
8 p.
 artikel
30 An integer programming model for the Minimum Interval Graph Completion Problem Lopes, Isabel Cristina
 2010
 36 C p. 583-590
8 p.
 artikel
31 An Iterated Local Search for Solving A Location-Routing Problem Derbel, Houda
 2010
 36 C p. 875-882
8 p.
 artikel
32 A particle swarm optimization approach for the bi-objective load balancing problem Krichen, Saoussen
 2010
 36 C p. 751-758
8 p.
 artikel
33 A post-optimization method to route scheduled lightpath demands with multiplicity Belgacem, Lucile
 2010
 36 C p. 263-270
8 p.
 artikel
34 Approximability of the Multiple Stack TSP Toulouse, Sophie
 2010
 36 C p. 813-820
8 p.
 artikel
35 Approximating the asymmetric profitable tour Nguyen, Viet Hung
 2010
 36 C p. 907-914
8 p.
 artikel
36 Approximation of the Clustered Set Covering Problem Alfandari, Laurent
 2010
 36 C p. 479-485
7 p.
 artikel
37 A quadratic programming problem arising from the p-version for obstacle problems Maischak, Matthias
 2010
 36 C p. 923-930
8 p.
 artikel
38 A roof linearization algorithm to obtain a tight upper bound for integer nonseparable quadratic programming Quadri, Dominique
 2010
 36 C p. 271-278
8 p.
 artikel
39 A simulated annealing for reconstructing hv-convex binary matrices Jarray, Fethi
 2010
 36 C p. 447-454
8 p.
 artikel
40 A Survey on Algorithms for the Maximum Internal Spanning Tree and Related Problems Salamon, Gábor
 2010
 36 C p. 1209-1216
8 p.
 artikel
41 A tabu search approach for the sum coloring problem Bouziri, Hend
 2010
 36 C p. 915-922
8 p.
 artikel
42 Automatic Selection of Beam Orientations in Intensity-Modulated Radiation Therapy Azizi-Sultan, Ahmad-Saher
 2010
 36 C p. 127-134
8 p.
 artikel
43 A Variable Neighborhood Search and its Application to a Ring Star Problem Generalization Salari, Majid
 2010
 36 C p. 343-350
8 p.
 artikel
44 Balanced list edge-colourings of bipartite graphs Fleiner, Tamás
 2010
 36 C p. 837-842
6 p.
 artikel
45 Balancedness of some subclasses of circular-arc graphs Bonomo, Flavia
 2010
 36 C p. 1121-1128
8 p.
 artikel
46 Climbing discrepancy search for flowshop and jobshop scheduling with time lags Karoui, Wafa
 2010
 36 C p. 821-828
8 p.
 artikel
47 Clique and chromatic number of circular-perfect graphs Pêcher, Arnaud
 2010
 36 C p. 199-206
8 p.
 artikel
48 Coloring Toeplitz graphs Nicoloso, Sara
 2010
 36 C p. 567-574
8 p.
 artikel
49 Column Generation based Primal Heuristics Joncour, C.
 2010
 36 C p. 695-702
8 p.
 artikel
50 Column Generation Method for an Agent Scheduling Problem Dezső, Balázs
 2010
 36 C p. 829-836
8 p.
 artikel
51 Combinatorial Optimization of Capacity and Flow Assignment Problem for Unicast and Anycast Connections with Linear and Convex Objective Functions – Exact and heuristic Algorithms Gladysz, Jakub
 2010
 36 C p. 1041-1048
8 p.
 artikel
52 Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges de Sá, Vinícius G.P.
 2010
 36 C p. 391-398
8 p.
 artikel
53 Consecutive ones matrices for multi-dimensional orthogonal packing problems Joncour, Cédric
 2010
 36 C p. 327-334
8 p.
 artikel
54 Cooperative model-based metaheuristics Hulianytskyi, Leonid
 2010
 36 C p. 33-40
8 p.
 artikel
55 Covering oriented points in the plane with orthogonal polygons is NP-complete Evrendilek, Cem
 2010
 36 C p. 303-310
8 p.
 artikel
56 Cross line and column generation for the cut covering problem in wireless networks Caillouet, Christelle
 2010
 36 C p. 255-262
8 p.
 artikel
57 Cutting-planes for weakly-coupled 0/1 second order cone programs Drewes, Sarah
 2010
 36 C p. 735-742
8 p.
 artikel
58 Discrete optimization methods to determine trajectories for Dubins' vehicles Medeiros, André César
 2010
 36 C p. 17-24
8 p.
 artikel
59 Earliest Arrival Flows in Networks with Multiple Sinks Schmidt, Melanie
 2010
 36 C p. 607-614
8 p.
 artikel
60 Estimating the relevance on Communication Lines Based on the Number of Edge Covers De Ita, Guillermo
 2010
 36 C p. 247-254
8 p.
 artikel
61 Euler Complexes (Oiks) Edmonds, Jack
 2010
 36 C p. 1289-1293
5 p.
 artikel
62 Exact Method for Robotic Cell Problem Kharbeche, Mohamed
 2010
 36 C p. 859-866
8 p.
 artikel
63 Experimental Analysis of an Online Trading Algorithm Schmidt, Günter
 2010
 36 C p. 519-526
8 p.
 artikel
64 Exposing Metaheuristics as Web Services in Distributed Systems using OpenCF Pérez, Melquíades
 2010
 36 C p. 151-158
8 p.
 artikel
65 Expressing Polynomials as the Permanent of low rank Square Matrices Ahmad, Mumtaz
 2010
 36 C p. 73-80
8 p.
 artikel
66 Extending the Single Machine-Based Relaxation Scheme for the Job Shop Scheduling Problem Gharbi, Anis
 2010
 36 C p. 1057-1064
8 p.
 artikel
67 Failure disjoint paths Żotkiewicz, Mateusz
 2010
 36 C p. 1105-1112
8 p.
 artikel
68 Finding Gale Strings Casetti, Marta M.
 2010
 36 C p. 1065-1072
8 p.
 artikel
69 Finding min-degree constrained spanning trees faster with a Branch-and-cut algorithm Conegundes Martinez, Leonardo
 2010
 36 C p. 311-318
8 p.
 artikel
70 Formulation symmetries in circle packing Costa, Alberto
 2010
 36 C p. 1303-1310
8 p.
 artikel
71 Grammar-Based Integer Programming Models for Multi-Activity Shift Scheduling Côté, Marie-Claude
 2010
 36 C p. 727-734
8 p.
 artikel
72 Hop-indexed Circuit-based formulations for the Traveling Salesman Problem Godinho, Maria Teresa
 2010
 36 C p. 1049-1056
8 p.
 artikel
73 Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel machines Zaidi, Makram
 2010
 36 C p. 543-550
8 p.
 artikel
74 Hybrid Variable Neighbourhood Decomposition Search for 0-1 Mixed Integer Programming Problem Hanafi, Saïd
 2010
 36 C p. 883-890
8 p.
 artikel
75 Hypergraph Extensions of the Erdős-Gallai Theorem Győri, Ervin
 2010
 36 C p. 655-662
8 p.
 artikel
76 Integrating job scheduling and constrained network routing Gamst, M.
 2010
 36 C p. 57-64
8 p.
 artikel
77 Inverse center location problems Burkard, Rainer E.
 2010
 36 C p. 105-110
6 p.
 artikel
78 IP-Based Energetic Reasoning for the Resource Constrained Project Scheduling Problem Kooli, Anis
 2010
 36 C p. 359-366
8 p.
 artikel
79 Lagrangian relaxation-based lower bound for resource-constrained modulo scheduling Ayala, Maria
 2010
 36 C p. 191-198
8 p.
 artikel
80 Large-scale multi-period precedence constrained knapsack problem: A mining application Moreno, Eduardo
 2010
 36 C p. 407-414
8 p.
 artikel
81 Load Balancing Optimization of Capacitated Networks with Path Protection de Sousa, Amaro
 2010
 36 C p. 1249-1256
8 p.
 artikel
82 1-local 7/5-competitive Algorithm for Multicoloring Hexagonal Graphs Witkowski, Rafał
 2010
 36 C p. 375-382
8 p.
 artikel
83 Lower Bounds for the Minimal Sum Coloring Problem Moukrim, A.
 2010
 36 C p. 663-670
8 p.
 artikel
84 Lower Bounds for the Minimum Linear Arrangement of a Graph Caprara, Alberto
 2010
 36 C p. 843-849
7 p.
 artikel
85 Matching with sizes (or scheduling with processing set restrictions) Biró, Péter
 2010
 36 C p. 335-342
8 p.
 artikel
86 Mathematical programming based debugging Liberti, Leo
 2010
 36 C p. 1311-1318
8 p.
 artikel
87 md-MST is NP-hard for d ≥ 3 de Almeida, Ana Maria
 2010
 36 C p. 9-15
7 p.
 artikel
88 Minimizing Expected Attacking Cost in Networks Gharbi, Anis
 2010
 36 C p. 947-954
8 p.
 artikel
89 Minimizing lateness for precedence graphs with constant delays on dedicated pipelined processors Benabid, Abir
 2010
 36 C p. 791-798
8 p.
 artikel
90 Minimizing total completion time on a batching machine with job processing time compatibilities Bellanger, A.
 2010
 36 C p. 1295-1302
8 p.
 artikel
91 Minimum Cost ≤k Edges Connected Subgraph Problems Sharifov, Firdovsi
 2010
 36 C p. 25-32
8 p.
 artikel
92 Mixed Integer NonLinear Programs featuring “On/Off” constraints: convex analysis and applications Hijazi, Hassan
 2010
 36 C p. 1153-1160
8 p.
 artikel
93 Modelling the Hop Constrained Connected Facility Location Problem on Layered Graphs Ljubić, Ivana
 2010
 36 C p. 207-214
8 p.
 artikel
94 Model reconstruction for discrete deterministic systems Torres, Luis M.
 2010
 36 C p. 175-182
8 p.
 artikel
95 MPQ-trees for orthogonal packing problem Joncour, Cédric
 2010
 36 C p. 423-429
7 p.
 artikel
96 Multiple crossover genetic algorithm for the multiobjective traveling salesman problem Elaoud, Semya
 2010
 36 C p. 939-946
8 p.
 artikel
97 Networks with unicyclic connected components and without short cycles Ben-Ameur, Walid
 2010
 36 C p. 961-968
8 p.
 artikel
98 New Families of Valid Inequalities for the Two-Echelon Vehicle Routing Problem Perboli, Guido
 2010
 36 C p. 639-646
8 p.
 artikel
99 New scheduling problems coming from grid computing Lissy, Alexandre
 2010
 36 C p. 1033-1040
8 p.
 artikel
100 Numerical Study of Semidefinite Bounds for the k-cluster Problem Malick, Jérôme
 2010
 36 C p. 399-406
8 p.
 artikel
101 On a bi-level formulation to protect uncapacitated p-median systems with facility recovery time and frequent disruptions Losada, Chaya
 2010
 36 C p. 591-598
8 p.
 artikel
102 On a particular case of the multi-criteria unconstrained optimization problem Gorski, Jochen
 2010
 36 C p. 135-142
8 p.
 artikel
103 On cardinality constrained polymatroids Stephan, Rüdiger
 2010
 36 C p. 1017-1024
8 p.
 artikel
104 On Finding Another Room-Partitioning of the Vertices Edmonds, Jack
 2010
 36 C p. 1257-1264
8 p.
 artikel
105 On Inverse Chromatic Number problems (Extended abstract) Chung, Yerim
 2010
 36 C p. 1129-1136
8 p.
 artikel
106 On Minimum Reload Cost Cycle Cover Galbiati, Giulia
 2010
 36 C p. 81-88
8 p.
 artikel
107 On the Chvátal-rank of Antiwebs Holm, Eugenia
 2010
 36 C p. 183-190
8 p.
 artikel
108 On the complexity of the Eulerian closed walk with precedence path constraints problem Kerivin, H.L.M.
 2010
 36 C p. 899-906
8 p.
 artikel
109 On the Convex Hull of Huffman Trees Maurras, Jean-François
 2010
 36 C p. 1009-1016
8 p.
 artikel
110 On the k-dominating set polytope of web graphs Argiroffo, Gabriela R.
 2010
 36 C p. 1161-1168
8 p.
 artikel
111 On the knapsack closure of 0-1 Integer Linear Programs Fischetti, Matteo
 2010
 36 C p. 799-804
6 p.
 artikel
112 On the p-median polytope of fork-free graphs Baïou, Mourad
 2010
 36 C p. 143-149
7 p.
 artikel
113 On the use of similarity metrics for approximate graph matching Kpodjedo, S.
 2010
 36 C p. 687-694
8 p.
 artikel
114 On the Vehicle Routing Problem with lower bound capacities Gouveia, Luis
 2010
 36 C p. 1001-1008
8 p.
 artikel
115 Optimal routing for minimizing the maximal link congestion Hijazi, Hassan
 2010
 36 C p. 1145-1152
8 p.
 artikel
116 Pancake Flipping with Two Spatulas Sharmin, Mahfuza
 2010
 36 C p. 231-238
8 p.
 artikel
117 Piece Selection Algorithm for Layered Video Streaming in P2P Networks Szkaliczki, Tibor
 2010
 36 C p. 1265-1272
8 p.
 artikel
118 Polynomial Lower Bounds for the Two-Machine Flowshop Problem with Sequence-Independent Setup Times Gharbi, Anis
 2010
 36 C p. 1089-1096
8 p.
 artikel
119 Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks Simonin, G.
 2010
 36 C p. 647-654
8 p.
 artikel
120 Polynomial traffic demand polytope partitioning Ben-Ameur, Walid
 2010
 36 C p. 1113-1120
8 p.
 artikel
121 Primal-dual simplex method for shooting Shim, Sangho
 2010
 36 C p. 719-726
8 p.
 artikel
122 Prospective Network Flow Models and Algorithms for Bin Packing Problems Quilliot, A.
 2010
 36 C p. 49-56
8 p.
 artikel
123 Query-based Information Gathering in Intelligent Transportation Systems Laborczi, Péter
 2010
 36 C p. 1201-1208
8 p.
 artikel
124 Rank of random half-integral polytopes — extended abstract — Braun, Gábor
 2010
 36 C p. 415-422
8 p.
 artikel
125 Recourse problem of the 2-stage robust location transportation problem Gabrel, V.
 2010
 36 C p. 167-174
8 p.
 artikel
126 Robust Aircraft Routing and Flight Retiming Aloulou, Mohamed Ali
 2010
 36 C p. 367-374
8 p.
 artikel
127 Routing Concurrent Video Signals over SDH Networks Giandomenico, Monia
 2010
 36 C p. 767-774
8 p.
 artikel
128 Row family inequalities for the set covering polyhedron Argiroffo, Gabriela R.
 2010
 36 C p. 1169-1176
8 p.
 artikel
129 Scarf Oiks Edmonds, Jack
 2010
 36 C p. 1281-1288
8 p.
 artikel
130 Scheduling flexible flowshops with unit-time operations and minimum time delays Rebaine, Djamal
 2010
 36 C p. 1193-1200
8 p.
 artikel
131 Scheduling on parallel machines considering job-machine dependency constraints Dourado, M.C.
 2010
 36 C p. 431-438
8 p.
 artikel
132 Search for the best compromise solution on Multiobjective shortest path problem Sauvanet, G.
 2010
 36 C p. 615-622
8 p.
 artikel
133 Semidefinite and Conic Programming for Robust wireless OFDMA networks Adasme, Pablo
 2010
 36 C p. 1225-1232
8 p.
 artikel
134 Sensitivity Analysis to Perturbations of the Weight of a Subset of Items: The Single Knapsack Case Study Hifi, Mhand
 2010
 36 C p. 439-446
8 p.
 artikel
135 Simultaneous Balancing and Scheduling of Flexible Mixed Model Assembly Lines with Sequence-Dependent Setup Times Ozturk, Cemalettin
 2010
 36 C p. 65-72
8 p.
 artikel
136 Solving Replica Placement and Request Distribution in Content Distribution Networks Neves, Tiago Araújo
 2010
 36 C p. 89-96
8 p.
 artikel
137 Some Valid Inequalities for the Probabilistic Minimum Power Multicasting Problem Barta, János
 2010
 36 C p. 463-470
8 p.
 artikel
138 Spanning Trees with Node Degree Dependent Costs and Knapsack Reformulations Gouveia, Luís
 2010
 36 C p. 985-992
8 p.
 artikel
139 Speculative data prefetching for branching structures in dataflow programms Carpov, Sergiu
 2010
 36 C p. 119-126
8 p.
 artikel
140 Sperner Oiks Edmonds, Jack
 2010
 36 C p. 1273-1280
8 p.
 artikel
141 Steiner Networks with unicyclic connected components Ben-Ameur, Walid
 2010
 36 C p. 969-976
8 p.
 artikel
142 Stochastic Quadratic Knapsack with Recourse Lisser, Abdel
 2010
 36 C p. 97-104
8 p.
 artikel
143 Stochastic Shortest Path Problem with Delay Excess Penalty Kosuch, Stefanie
 2010
 36 C p. 511-518
8 p.
 artikel
144 Strength of Three MIP Formulations for the Prize Collecting Steiner Tree Problem with a Quota Constraint Haouari, Mohamed
 2010
 36 C p. 495-502
8 p.
 artikel
145 Strong Lower Bounds for a Survivable Network Design Problem Leitner, Markus
 2010
 36 C p. 295-302
8 p.
 artikel
146 Structural Analysis for Differential-Algebraic Systems: Complexity, Formulation and Facets Lacroix, Mathieu
 2010
 36 C p. 1073-1080
8 p.
 artikel
147 Submodular Formulations for Range Assignment Problems Baumann, Frank
 2010
 36 C p. 239-246
8 p.
 artikel
148 Submodularity and Randomized rounding techniques for Optimal Experimental Design Bouhtou, Mustapha
 2010
 36 C p. 679-686
8 p.
 artikel
149 The biclique k-clustering problem in bipartite graphs and its application in bioinformatics Acuña, V.
 2010
 36 C p. 159-166
8 p.
 artikel
150 The computational complexity of the Edge-Perfect Graph and the Totally Balanced Packing Game recognition problems Dobson, M.P.
 2010
 36 C p. 551-558
8 p.
 artikel
151 The inverse 1-median problem on a tree and on a path Galavii, Mohammadreza
 2010
 36 C p. 1241-1248
8 p.
 artikel
152 The k-limited packing and k-tuple domination problems in strongly chordal, P 4-tidy and split graphs Dobson, M.P.
 2010
 36 C p. 559-566
8 p.
 artikel
153 The Location-Dispatching Problem: polyhedral results and Content Delivery Network Design Chrétienne, Philippe
 2010
 36 C p. 867-874
8 p.
 artikel
154 The 1-Median Problem in R d with the Chebyshev-Norm and its Inverse Problem Hatzl, Johannes
 2010
 36 C p. 1137-1144
8 p.
 artikel
155 The minimax problem solving of physical fields sources allocation in specified positions Yaremchuk, Svetlana
 2010
 36 C p. 599-606
8 p.
 artikel
156 The positive circuits of oriented matroids with the packing property or idealness Kashiwabara, Kenji
 2010
 36 C p. 287-294
8 p.
 artikel
157 The sandwich line graph Cornaz, Denis
 2010
 36 C p. 955-960
6 p.
 artikel
158 The set covering problem on circulant matrices: polynomial instances and the relation with the dominating set problem on webs Bianchi, S.
 2010
 36 C p. 1185-1192
8 p.
 artikel
159 The stable set polytope of claw-free graphs with large stability number Galluccio, A.
 2010
 36 C p. 1025-1032
8 p.
 artikel
160 The Stochastic Guaranteed Service Model with Recourse for Multi-Echelon Warehouse Management Rambau, Jörg
 2010
 36 C p. 783-790
8 p.
 artikel
161 Time dependent multiobjective best path for multimodal urban routing Gräbener, Tristram
 2010
 36 C p. 487-494
8 p.
 artikel
162 Total chromatic number of {square,unichord}-free graphs Machado, R.C.S.
 2010
 36 C p. 671-678
8 p.
 artikel
163 Tree based heuristics for the preemptive asymmetric stacker crane problem Quilliot, A.
 2010
 36 C p. 41-48
8 p.
 artikel
164 Using DRL* relaxations for quadratically constrained pseudoboolean optimization: application to robust Min-Cut Minoux, Michel
 2010
 36 C p. 1217-1224
8 p.
 artikel
165 Valid Inequalities and Convex Hulls for Multilinear Functions Belotti, Pietro
 2010
 36 C p. 805-812
8 p.
 artikel
166 Variable Neighbourhood Pump Heuristic for 0-1 Mixed Integer Programming Feasibility Hanafi, Saïd
 2010
 36 C p. 759-766
8 p.
 artikel
167 Variable Parameters Lengths Genetic Algorithm for Minimizing Earliness-Tardiness Penalties of Single Machine Scheduling With a Common Due Date Allaoua, Hemmak
 2010
 36 C p. 471-478
8 p.
 artikel
                             167 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland