Editorial for the special issue on metaheuristics for combinatorial optimization.
- Published in:
- 2018
- By:
- Publication type:
- Editorial
Works matching IS 13811231 AND DT 2018 AND VI 24 AND IP 3
Results: 13
1
2
A constraint-based parallel local search for the edge-disjoint rooted distance-constrained minimum spanning tree problem.
- Published in:
- Journal of Heuristics, 2018, v. 24, n. 3, p. 359, doi. 10.1007/s10732-017-9342-0
- By:
- Publication type:
- Article
3
On a two-phase solution approach for the bi-objective k-dissimilar vehicle routing problem.
- Published in:
- Journal of Heuristics, 2018, v. 24, n. 3, p. 515, doi. 10.1007/s10732-017-9341-1
- By:
- Publication type:
- Article
4
Finding short and implementation-friendly addition chains with evolutionary algorithms.
- Published in:
- Journal of Heuristics, 2018, v. 24, n. 3, p. 457, doi. 10.1007/s10732-017-9340-2
- By:
- Publication type:
- Article
5
Dynamic reconfiguration in multigroup multicast routing under uncertainty.
- Published in:
- Journal of Heuristics, 2018, v. 24, n. 3, p. 395, doi. 10.1007/s10732-017-9339-8
- By:
- Publication type:
- Article
6
Metaheuristic approaches to the placement of suicide bomber detectors.
- Published in:
- Journal of Heuristics, 2018, v. 24, n. 3, p. 483, doi. 10.1007/s10732-017-9335-z
- By:
- Publication type:
- Article
7
Mapping the global structure of TSP fitness landscapes.
- Published in:
- Journal of Heuristics, 2018, v. 24, n. 3, p. 265, doi. 10.1007/s10732-017-9334-0
- By:
- Publication type:
- Article
8
PageRank centrality for performance prediction: the impact of the local optima network model.
- Published in:
- Journal of Heuristics, 2018, v. 24, n. 3, p. 243, doi. 10.1007/s10732-017-9333-1
- By:
- Publication type:
- Article
9
Evolutionary computation for automatic Web service composition: an indirect representation approach.
- Published in:
- Journal of Heuristics, 2018, v. 24, n. 3, p. 425, doi. 10.1007/s10732-017-9330-4
- By:
- Publication type:
- Article
10
A comprehensive comparison of metaheuristics for the repetition-free longest common subsequence problem.
- Published in:
- Journal of Heuristics, 2018, v. 24, n. 3, p. 551, doi. 10.1007/s10732-017-9329-x
- By:
- Publication type:
- Article
11
A case study of algorithm selection for the traveling thief problem.
- Published in:
- Journal of Heuristics, 2018, v. 24, n. 3, p. 295, doi. 10.1007/s10732-017-9328-y
- By:
- Publication type:
- Article
12
Tackling the edge dynamic graph colouring problem with and without future adjacency information.
- Published in:
- Journal of Heuristics, 2018, v. 24, n. 3, p. 321, doi. 10.1007/s10732-017-9327-z
- By:
- Publication type:
- Article
13
Simple but effective heuristics for the 2-constraint bin packing problem.
- Published in:
- Journal of Heuristics, 2018, v. 24, n. 3, p. 345, doi. 10.1007/s10732-017-9326-0
- By:
- Publication type:
- Article