scientific article; zbMATH DE number 1082103
From MaRDI portal
Publication:4365130
zbMath0932.90031MaRDI QIDQ4365130
Dominique de Werra, Éric D. Taillard, Alain Hertz
Publication date: 19 March 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
combinatorial optimizationtabu searchvehicle routinggraph coloringheuristic algorithmcourse scheduling
Related Items
A unified heuristic for a large class of vehicle routing problems with backhauls, A review of chaos-based firefly algorithms: perspectives and research challenges, An improved tabu search approach for solving the job shop scheduling problem with tooling constraints, Diversification strategies in tabu search algorithms for the maximum clique problem, Metaheuristics: A bibliography, Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs, Greedy scheduling with custom-made objectives, A tabu search method guided by shifting bottleneck for the job shop scheduling problem, Artificial life techniques for load balancing in computational grids, Scheduling coupled-operation jobs with exact time-lags, Comprehensive optimization of urban rail transit timetable by minimizing total travel times under time-dependent passenger demand and congested conditions, Edge-swapping algorithms for the minimum fundamental cycle basis problem, A survey on metaheuristics for stochastic combinatorial optimization, Digital data networks design using genetic algorithms, Algorithms for finding minimum fundamental cycle bases in graphs, Tabu search heuristics for the vehicle routing problem with time windows.
