Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnnals of Operations Research, Volume 63
Volume 63, Number 1, 1996
- Gilbert Laporte, Ibrahim H. Osman:
Foreword. 1-2 - Wen-Chyuan Chiang
, Robert A. Russell:
Simulated annealing metaheuristics for the vehicle routing problem with time windows. 3-27 - Andrew Sohn:
Generalized speculative computation of parallel simulated annealing. 29-55 - Olivier C. Martin, Steve W. Otto:
Combining simulated annealing with local search heuristics. 57-75 - Norman M. Sadeh, Yoichiro Nakakuki:
Focused simulated annealing search: An application to job shop scheduling. 77-103 - Jonathan M. Thompson, Kathryn A. Dowsland:
Variants of simulated annealing for the examination timetabling problem. 105-128 - David Abramson, Henry Dang, Mohan Krishnamoorthy:
A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm. 129-150
Volume 63, Number 2, 1996
- Roberto Battiti, Giampietro Tecchiolli:
The continuous reactive tabu search: Blending combinatorial optimization and stochastic search for global optimization. 151-188 - Patrick Soriano, Michel Gendreau:
Diversification strategies in tabu search algorithms for the maximum clique problem. 189-207 - Erik Rolland, Hasan Pirkul, Fred W. Glover:
Tabu search for graph partitioning. 209-232 - Vicente Valls, Rafael Martí, M. Pilar Lino Sorlí:
A tabu thresholding algorithm for arc crossing minimization in bipartite graphs. 233-251 - Stefan Voß:
Dynamic tabu search strategies for the traveling purchaser problem. 253-275 - Teodor Gabriel Crainic, Michel Toulouse, Michel Gendreau:
Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements. 277-299 - D. J. Castelino, Stephen Hurley, N. M. Stephens:
A tabu search algorithm for frequency assignment. 301-319 - Pierre Hansen, Keh-Wei Lih:
Heuristic reliability optimization by tabu search. 321-336
Volume 63, Number 3, 1996
- Jean-Yves Potvin:
Genetic algorithms for the traveling salesman problem. 337-370 - Colin Reeves:
Hybrid genetic algorithms for bin-packing and related problems. 371-396 - Amit Nagar, Sunderesh S. Heragu, Jorge Haddock:
A combined branch-and-bound and genetic algorithm based approach for a flowshop scheduling problem. 397-414 - Edward A. Herbert, Kathryn A. Dowsland:
A family of genetic algorithms for the pallet loading problem. 415-436 - Charles Fleurent, Jacques A. Ferland:
Genetic and hybrid algorithms for graph coloring. 437-461
Volume 63, Number 4, 1996
- Robert H. Storer, Seth W. Flanders, S. David Wu:
Problem space local search for number partitioning. 463-487 - Celia A. Glass, Chris N. Potts:
A comparison of local search methods for flow shop scheduling. 489-509
Volume 63, Number 5, 1996
- Ibrahim H. Osman, Gilbert Laporte:
Metaheuristics: A bibliography. 511-623
a service of 
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 2024-04-19 19:20 CEST 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:
