A heuristic approach for dividing graphs into bi-connected components with a size constraint.
- Published in:
- Journal of Heuristics, 2017, v. 23, n. 2/3, p. 111, doi. 10.1007/s10732-017-9331-3
- By:
- Publication type:
- Article
Works matching IS 13811231 AND DT 2017 AND VI 23 AND IP 2/3
Results: 3
1
2
A variable neighborhood search for the network design problem with relays.
- Published in:
- Journal of Heuristics, 2017, v. 23, n. 2/3, p. 137, doi. 10.1007/s10732-017-9332-2
- By:
- Publication type:
- Article
3
Scatter search for minimizing weighted tardiness in a single machine scheduling with setups.
- Published in:
- Journal of Heuristics, 2017, v. 23, n. 2/3, p. 81, doi. 10.1007/s10732-017-9325-1
- By:
- Publication type:
- Article