Works matching IS 00283045 AND DT 2020 AND VI 75 AND IP 3
Results: 7
Minimum shared‐power edge cut.
- Published in:
- Networks, 2020, v. 75, n. 3, p. 321, doi. 10.1002/net.21928
- By:
- Publication type:
- Article
Fixed parameter tractability of a biconnected bottleneck Steiner network problem.
- Published in:
- Networks, 2020, v. 75, n. 3, p. 310, doi. 10.1002/net.21926
- By:
- Publication type:
- Article
Covering edges in networks.
- Published in:
- Networks, 2020, v. 75, n. 3, p. 278, doi. 10.1002/net.21924
- By:
- Publication type:
- Article
Parameterized complexity of finding a spanning tree with minimum reload cost diameter.
- Published in:
- Networks, 2020, v. 75, n. 3, p. 259, doi. 10.1002/net.21923
- By:
- Publication type:
- Article
Two‐stage stochastic minimum s − t cut problems: Formulations, complexity and decomposition algorithms.
- Published in:
- Networks, 2020, v. 75, n. 3, p. 235, doi. 10.1002/net.21922
- By:
- Publication type:
- Article
Issue Information.
- Published in:
- Networks, 2020, v. 75, n. 3, p. 233, doi. 10.1002/net.21895
- Publication type:
- Article
Primal column generation framework for vehicle and crew scheduling problems.
- Published in:
- Networks, 2020, v. 75, n. 3, p. 291, doi. 10.1002/net.21925
- By:
- Publication type:
- Article