Optimal connected subgraphs: Integer programming formulations and polyhedra.
- Published in:
- Networks, 2022, v. 80, n. 3, p. 314, doi. 10.1002/net.22101
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2022 AND VI 80 AND IP 3
Results: 8
1
2
The consistent production routing problem.
- Published in:
- Networks, 2022, v. 80, n. 3, p. 356, doi. 10.1002/net.22112
- By:
- Publication type:
- Article
3
On the complexity of the bilevel minimum spanning tree problem.
- Published in:
- Networks, 2022, v. 80, n. 3, p. 338, doi. 10.1002/net.22111
- By:
- Publication type:
- Article
4
Issue Information.
- Published in:
- Networks, 2022, v. 80, n. 3, p. 265, doi. 10.1002/net.22053
- Publication type:
- Article
5
A branch‐and‐cut algorithm for the pickup‐and‐delivery traveling salesman problem with handling costs.
- Published in:
- Networks, 2022, v. 80, n. 3, p. 297, doi. 10.1002/net.22096
- By:
- Publication type:
- Article
6
A column generation algorithm for the demand‐responsive feeder service with mandatory and optional, clustered bus‐stops.
- Published in:
- Networks, 2022, v. 80, n. 3, p. 274, doi. 10.1002/net.22095
- By:
- Publication type:
- Article
7
Integrality in the multinetwork min‐cost equal‐flow problem.
- Published in:
- Networks, 2022, v. 80, n. 3, p. 267, doi. 10.1002/net.22094
- By:
- Publication type:
- Article
8
A simple proof of the Gross‐Saccoman multigraph conjecture.
- Published in:
- Networks, 2022, v. 80, n. 3, p. 333, doi. 10.1002/net.22110
- By:
- Publication type:
- Article