default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnnals of Operations Research, Volume 86
Volume 86, 1999
- Yazid M. Sharaiha, John E. Beasley:
Foreword. 0 - David Abramson, Marcus Randall:
A simulated annealing code for general integer linear programs. 3-21 - Shara Amin:
Simulated Jumping. 23-38 - M. T. Hajian, R. Rodosek, B. Richards:
Introduction of a new class of variables to discrete and integer programmingproblems. 39-51 - Marek Libura:
On accuracy of solutions for discrete optimization problems with perturbed coefficientsof the objective function. 53-62 - R. Rodosek, Mark G. Wallace, M. T. Hajian:
A new approach to integrating mixed integer programming and constraint logicprogramming. 63-87 - Khaled S. Al-Sultan, Mohammad Abdulrahman Al-Fawzan:
A tabu search approach to the uncapacitated facility location problem. 91-103 - Pasquale Avella, Antonio Sforza:
Logical reduction tests for the p-problem. 105-115 - Pierre Chardaire, J.-L. Lutton, Alain Sutter:
Upper and lower bounds for the two-level simple plant location problem. 117-140 - Andreas T. Ernst, Mohan Krishnamoorthy
:
Solution algorithms for the capacitated single allocation hub location problem. 141-159 - Cory J. Hoelting, Dale A. Schoenefeld, Roger L. Wainwright:
Analysis of fault location in a network. 161-177 - Alfredo Marín, Blas Pelegrín:
Applying Lagrangian relaxation to the resolution of two-stage location problems. 179-198 - Geraldo Robson Mateus, Jean-Michel Thizy:
Exact sequential choice of locations in a network. 199-219 - Rosa Maria Ramos, María Teresa Ramos, Marcos Colebrook, Joaquín Sicilia:
Locating a facility on a network with multiple median-type objectives. 221-235 - C. J. Burgess, Alain G. Chalmers:
Optimisation of irregular multiprocessor computer architectures using geneticalgorithms. 239-257 - D. Castelino, N. M. Stephens:
A surrogate constraint tabu thresholding implementation for the frequency assignmentproblem. 259-270 - Luis Eduardo Neves Gouveia, Pedro Martins:
The Capacitated Minimal Spanning Tree Problem: An experiment with a hop-indexedmodel. 271-294 - S. A. Harrison, Victor J. Rayward-Smith:
Minimal cost linkages in graphs. 295-319 - Stefan Voß:
The Steiner tree problem with hop constraints. 321-345 - A. R. P. White, J. W. Mann, G. D. Smith:
Genetic algorithms and network ring design. 347-371 - Shoshana Anily, Celia A. Glass, Refael Hassin:
Scheduling maintenance services to three machines. 375-391 - Lucio Bianco, Paolo Dell'Olmo, Stefano Giordani:
Minimizing total completion time subject to release dates and sequence-dependentprocessing times. 393-415 - Inna G. Drobouchevitch, Vitaly A. Strusevich:
A heuristic algorithm for two-machine re-entrant shop scheduling. 417-439 - Dirk C. Mattfeld, Christian Bierwirth, Herbert Kopfer:
A search space analysis of the Job Shop Scheduling Problem. 441-453 - Aziz Moukrim:
On the minimum number of processors for scheduling problems with communicationdelays. 455-472 - C. R. Reeves:
Landscapes, operators and heuristic search. 473-490 - Maria Grazia Speranza, Zsolt Tuza:
On-line approximation algorithms for scheduling tasks on identical machines withextendable working time. 491-506 - Keisuke Tanaka, Milan Vlach:
Minimizing maximum absolute lateness and range of lateness under generalizeddue dates on a single machine. 507-526 - Egon Balas:
New classes of efficiently solvable generalized Traveling Salesman Problems. 529-558 - Chuda B. Basnet, Les R. Foulds, John M. Wilson:
An exact algorithm for a milk tanker scheduling and sequencing problem. 559-568 - Curt Hjorring, John Holt:
New optimality cuts for a single-vehicle stochastic routing problem. 569-584 - Jürgen Schulze, Torsten Fahle:
A parallel algorithm for the vehicle routing problem with time window constraints. 585-607 - Michael J. Brusco, Larry W. Jacobs, Gary M. Thompson:
A morphing procedure to supplement a simulated annealing heuristic for cost- andcoverage-correlated set-covering problems. 611-627 - José M. Valério de Carvalho:
Exact solution of bin-packing problems using column generation and branch-and-bound. 629-659
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-04 01:27 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
