A simulated annealing code for general integer linear programs D. AbramsonM. Randall OriginalPaper Pages: 3 - 21
Introduction of a new class of variables to discrete and integer programmingproblems M.T. HajianR. RodosekB. Richards OriginalPaper Pages: 39 - 51
On accuracy of solutions for discrete optimization problems with perturbed coefficientsof the objective function M. Libura OriginalPaper Pages: 53 - 62
A new approach to integrating mixed integer programming and constraint logicprogramming R. RodosekM.G. WallaceM.T. Hajian OriginalPaper Pages: 63 - 87
A tabu search approach to the uncapacitated facility location problem K.S. Al‐SultanM.A. Al‐Fawzan OriginalPaper Pages: 91 - 103
Upper and lower bounds for the two‐level simple plant location problem P. ChardaireJ.‐L. LuttonA. Sutter OriginalPaper Pages: 117 - 140
Solution algorithms for the capacitated single allocation hub location problem A.T. ErnstM. Krishnamoorthy OriginalPaper Pages: 141 - 159
Analysis of fault location in a network C.J. HoeltingD.A. SchoenefeldR.L. Wainwright OriginalPaper Pages: 161 - 177
Applying Lagrangian relaxation to the resolution of two‐stage location problems A. MarínB. Pelegrín OriginalPaper Pages: 179 - 198
Exact sequential choice of locations in a network G.R. MateusJ.‐M. Thizy OriginalPaper Pages: 199 - 219
Locating a facility on a network with multiple median‐type objectives R.M. RamosM.T. RamosJ. Sicilia OriginalPaper Pages: 221 - 235
Optimisation of irregular multiprocessor computer architectures using geneticalgorithms C.J. BurgessA.G. Chalmers OriginalPaper Pages: 239 - 257
A surrogate constraint tabu thresholding implementation for the frequency assignmentproblem D. CastelinoN. Stephens OriginalPaper Pages: 259 - 270
The Capacitated Minimal Spanning Tree Problem: An experiment with a hop‐indexedmodel L. GouveiaP. Martins OriginalPaper Pages: 271 - 294
Genetic algorithms and network ring design A.R.P. WhiteJ.W. MannG.D. Smith OriginalPaper Pages: 347 - 371
Scheduling maintenance services to three machines S. AnilyC.A. GlassR. Hassin OriginalPaper Pages: 375 - 391
Minimizing total completion time subject to release dates and sequence‐dependentprocessing times L. BiancoP. Dell'OlmoS. Giordani OriginalPaper Pages: 393 - 415
A heuristic algorithm for two‐machine re‐entrant shop scheduling I.G. DrobouchevitchV.A. Strusevich OriginalPaper Pages: 417 - 439
A search space analysis of the Job Shop Scheduling Problem D.C. MattfeldC. BierwirthH. Kopfer OriginalPaper Pages: 441 - 453
On the minimum number of processors for scheduling problems with communicationdelays A. Moukrim OriginalPaper Pages: 455 - 472
On‐line approximation algorithms for scheduling tasks on identical machines withextendable working time M.G. SperanzaZs. Tuza OriginalPaper Pages: 491 - 506
Minimizing maximum absolute lateness and range of lateness under generalizeddue dates on a single machine K. TanakaM. Vlach OriginalPaper Pages: 507 - 526
New classes of efficiently solvable generalized Traveling Salesman Problems E. Balas OriginalPaper Pages: 529 - 558
An exact algorithm for a milk tanker scheduling and sequencing problem C. BasnetL.R. FouldsJ.M. Wilson OriginalPaper Pages: 559 - 568
New optimality cuts for a single‐vehicle stochastic routing problem C. HjorringJ. Holt OriginalPaper Pages: 569 - 584
A parallel algorithm for the vehicle routing problem with time window constraints J. SchulzeT. Fahle OriginalPaper Pages: 585 - 607
A morphing procedure to supplement a simulated annealing heuristic for cost‐ andcoverage‐correlated set‐covering problems M.J. BruscoL.W. JacobsG.M. Thompson OriginalPaper Pages: 611 - 627
Exact solution of bin‐packing problems using column generation and branch‐and‐bound J.M. Valério de Carvalho OriginalPaper Pages: 629 - 659
