| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A heuristic algorithm for two‐machine re‐entrant shop scheduling
|
Drobouchevitch, I.G.
|
|
1999
|
86 |
0 |
p. 417-439
|
artikel
|
| 2 |
A morphing procedure to supplement a simulated annealing heuristic for cost‐ andcoverage‐correlated set‐covering problems
|
Brusco, M.J.
|
|
1999
|
86 |
0 |
p. 611-627
|
artikel
|
| 3 |
Analysis of fault location in a network
|
Hoelting, C.J.
|
|
1999
|
86 |
0 |
p. 161-177
|
artikel
|
| 4 |
A new approach to integrating mixed integer programming and constraint logicprogramming
|
Rodosek, R.
|
|
1999
|
86 |
0 |
p. 63-87
|
artikel
|
| 5 |
An exact algorithm for a milk tanker scheduling and sequencing problem
|
Basnet, C.
|
|
1999
|
86 |
0 |
p. 559-568
|
artikel
|
| 6 |
A parallel algorithm for the vehicle routing problem with time window constraints
|
Schulze, J.
|
|
1999
|
86 |
0 |
p. 585-607
|
artikel
|
| 7 |
Applying Lagrangian relaxation to the resolution of two‐stage location problems
|
Marín, A.
|
|
1999
|
86 |
0 |
p. 179-198
|
artikel
|
| 8 |
A search space analysis of the Job Shop Scheduling Problem
|
Mattfeld, D.C.
|
|
1999
|
86 |
0 |
p. 441-453
|
artikel
|
| 9 |
A simulated annealing code for general integer linear programs
|
Abramson, D.
|
|
1999
|
86 |
0 |
p. 3-21
|
artikel
|
| 10 |
A surrogate constraint tabu thresholding implementation for the frequency assignmentproblem
|
Castelino, D.
|
|
1999
|
86 |
0 |
p. 259-270
|
artikel
|
| 11 |
A tabu search approach to the uncapacitated facility location problem
|
Al‐Sultan, K.S.
|
|
1999
|
86 |
0 |
p. 91-103
|
artikel
|
| 12 |
Exact sequential choice of locations in a network
|
Mateus, G.R.
|
|
1999
|
86 |
0 |
p. 199-219
|
artikel
|
| 13 |
Exact solution of bin‐packing problems using column generation and branch‐and‐bound
|
Valério de Carvalho, J.M.
|
|
1999
|
86 |
0 |
p. 629-659
|
artikel
|
| 14 |
Foreword
|
Sharaiha, Y.M.
|
|
1999
|
86 |
0 |
p. 0
|
artikel
|
| 15 |
Genetic algorithms and network ring design
|
White, A.R.P.
|
|
1999
|
86 |
0 |
p. 347-371
|
artikel
|
| 16 |
Introduction of a new class of variables to discrete and integer programmingproblems
|
Hajian, M.T.
|
|
1999
|
86 |
0 |
p. 39-51
|
artikel
|
| 17 |
Landscapes, operators and heuristic search
|
Reeves, C.R.
|
|
1999
|
86 |
0 |
p. 473-490
|
artikel
|
| 18 |
Locating a facility on a network with multiple median‐type objectives
|
Ramos, R.M.
|
|
1999
|
86 |
0 |
p. 221-235
|
artikel
|
| 19 |
Logical reduction tests for the p‐problem
|
Avella, P.
|
|
1999
|
86 |
0 |
p. 105-115
|
artikel
|
| 20 |
Minimal cost linkages in graphs
|
Harrison, S.A.
|
|
1999
|
86 |
0 |
p. 295-319
|
artikel
|
| 21 |
Minimizing maximum absolute lateness and range of lateness under generalizeddue dates on a single machine
|
Tanaka, K.
|
|
1999
|
86 |
0 |
p. 507-526
|
artikel
|
| 22 |
Minimizing total completion time subject to release dates and sequence‐dependentprocessing times
|
Bianco, L.
|
|
1999
|
86 |
0 |
p. 393-415
|
artikel
|
| 23 |
New classes of efficiently solvable generalized Traveling Salesman Problems
|
Balas, E.
|
|
1999
|
86 |
0 |
p. 529-558
|
artikel
|
| 24 |
New optimality cuts for a single‐vehicle stochastic routing problem
|
Hjorring, C.
|
|
1999
|
86 |
0 |
p. 569-584
|
artikel
|
| 25 |
On accuracy of solutions for discrete optimization problems with perturbed coefficientsof the objective function
|
Libura, M.
|
|
1999
|
86 |
0 |
p. 53-62
|
artikel
|
| 26 |
On‐line approximation algorithms for scheduling tasks on identical machines withextendable working time
|
Speranza, M.G.
|
|
1999
|
86 |
0 |
p. 491-506
|
artikel
|
| 27 |
On the minimum number of processors for scheduling problems with communicationdelays
|
Moukrim, A.
|
|
1999
|
86 |
0 |
p. 455-472
|
artikel
|
| 28 |
Optimisation of irregular multiprocessor computer architectures using geneticalgorithms
|
Burgess, C.J.
|
|
1999
|
86 |
0 |
p. 239-257
|
artikel
|
| 29 |
Scheduling maintenance services to three machines
|
Anily, S.
|
|
1999
|
86 |
0 |
p. 375-391
|
artikel
|
| 30 |
Simulated Jumping
|
Amin, S.
|
|
1999
|
86 |
0 |
p. 23-38
|
artikel
|
| 31 |
Solution algorithms for the capacitated single allocation hub location problem
|
Ernst, A.T.
|
|
1999
|
86 |
0 |
p. 141-159
|
artikel
|
| 32 |
The Capacitated Minimal Spanning Tree Problem: An experiment with a hop‐indexedmodel
|
Gouveia, L.
|
|
1999
|
86 |
0 |
p. 271-294
|
artikel
|
| 33 |
The Steiner tree problem with hop constraints
|
Voß, S.
|
|
1999
|
86 |
0 |
p. 321-345
|
artikel
|
| 34 |
Upper and lower bounds for the two‐level simple plant location problem
|
Chardaire, P.
|
|
1999
|
86 |
0 |
p. 117-140
|
artikel
|
Tijdschrift beschrijving