A modeling and computational study of the frustration index in signed networks.
- Published in:
- Networks, 2020, v. 75, n. 1, p. 95, doi. 10.1002/net.21907
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2020 AND VI 75 AND IP 1
Results: 7
1
2
An extended formulation for the 1‐wheel inequalities of the stable set polytope.
- Published in:
- Networks, 2020, v. 75, n. 1, p. 86, doi. 10.1002/net.21906
- By:
- Publication type:
- Article
3
Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location.
- Published in:
- Networks, 2020, v. 75, n. 1, p. 64, doi. 10.1002/net.21905
- By:
- Publication type:
- Article
4
Parameterized algorithms and data reduction for the short secluded s‐t‐path problem.
- Published in:
- Networks, 2020, v. 75, n. 1, p. 34, doi. 10.1002/net.21904
- By:
- Publication type:
- Article
5
Lexicographically optimal earliest arrival flows.
- Published in:
- Networks, 2020, v. 75, n. 1, p. 18, doi. 10.1002/net.21902
- By:
- Publication type:
- Article
6
Stronger path‐based extended formulation for the Steiner tree problem.
- Published in:
- Networks, 2020, v. 75, n. 1, p. 3, doi. 10.1002/net.21901
- By:
- Publication type:
- Article
7
Issue Information.
- Published in:
- Networks, 2020, v. 75, n. 1, p. 1, doi. 10.1002/net.21893
- Publication type:
- Article