Feasibility in transportation networks with supply eating arcs.
- Published in:
- Networks, 1998, v. 31, n. 3, p. 165, doi. 10.1002/(SICI)1097-0037(199805)31:3<165::AID-NET3>3.0.CO;2-D
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 1998 AND VI 31 AND IP 3
Results: 6
1
2
Edge connectivity between nodes and node-subsets.
- Published in:
- Networks, 1998, v. 31, n. 3, p. 157, doi. 10.1002/(SICI)1097-0037(199805)31:3<157::AID-NET2>3.0.CO;2-E
- By:
- Publication type:
- Article
3
A dynamic programming algorithm for the shortest path problem with time windows and linear node costs.
- Published in:
- Networks, 1998, v. 31, n. 3, p. 193, doi. 10.1002/(SICI)1097-0037(199805)31:3<193::AID-NET6>3.0.CO;2-A
- By:
- Publication type:
- Article
4
Flow-dependent networks: Existence and behavior at Steiner points.
- Published in:
- Networks, 1998, v. 31, n. 3, p. 149, doi. 10.1002/(SICI)1097-0037(199805)31:3<149::AID-NET1>3.0.CO;2-F
- By:
- Publication type:
- Article
5
Verification of DAG structures in cooperative belief network-based multiagent systems.
- Published in:
- Networks, 1998, v. 31, n. 3, p. 183, doi. 10.1002/(SICI)1097-0037(199805)31:3<183::AID-NET5>3.0.CO;2-B
- By:
- Publication type:
- Article
6
A linear-time algorithm for connected r-domination and Steiner tree on distance-hereditary graphs.
- Published in:
- Networks, 1998, v. 31, n. 3, p. 177, doi. 10.1002/(SICI)1097-0037(199805)31:3<177::AID-NET4>3.0.CO;2-C
- By:
- Publication type:
- Article