Minimum cost flow problem with conflicts.
- Published in:
- Networks, 2021, v. 78, n. 4, p. 421, doi. 10.1002/net.22021
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2021 AND VI 78 AND IP 4
Results: 9
1
2
A solution approach for multi‐trip vehicle routing problems with time windows, fleet sizing, and depot location.
- Published in:
- Networks, 2021, v. 78, n. 4, p. 503, doi. 10.1002/net.22028
- By:
- Publication type:
- Article
3
A mathematical formulation and an LP‐based neighborhood search matheuristic solution method for the integrated train blocking and shipment path problem.
- Published in:
- Networks, 2021, v. 78, n. 4, p. 523, doi. 10.1002/net.22029
- By:
- Publication type:
- Article
4
The invisible‐hand heuristic for origin‐destination integer multicommodity network flows.
- Published in:
- Networks, 2021, v. 78, n. 4, p. 484, doi. 10.1002/net.22026
- By:
- Publication type:
- Article
5
A two‐tier urban delivery network with robot‐based deliveries.
- Published in:
- Networks, 2021, v. 78, n. 4, p. 461, doi. 10.1002/net.22024
- By:
- Publication type:
- Article
6
Solving the team orienteering problem with nonidentical agents: A Lagrangian approach.
- Published in:
- Networks, 2021, v. 78, n. 4, p. 443, doi. 10.1002/net.22023
- By:
- Publication type:
- Article
7
Parcel delivery cost minimization with time window constraints using trucks and drones.
- Published in:
- Networks, 2021, v. 78, n. 4, p. 400, doi. 10.1002/net.22019
- By:
- Publication type:
- Article
8
Trucks and drones cooperation in the last‐mile delivery process.
- Published in:
- Networks, 2021, v. 78, n. 4, p. 371, doi. 10.1002/net.22015
- By:
- Publication type:
- Article
9
Issue Information.
- Published in:
- Networks, 2021, v. 78, n. 4, p. 369, doi. 10.1002/net.21957
- Publication type:
- Article