A branch-and-cut algorithm for the undirected selective traveling salesman problem.
- Published in:
- Networks, 1998, v. 32, n. 4, p. 263, doi. 10.1002/(SICI)1097-0037(199812)32:4<263::AID-NET3>3.0.CO;2-Q
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 1998 AND VI 32 AND IP 4
Results: 7
1
2
On container length and connectivity in unidirectional hypercubes.
- Published in:
- Networks, 1998, v. 32, n. 4, p. 307, doi. 10.1002/(SICI)1097-0037(199812)32:4<307::AID-NET7>3.0.CO;2-5
- By:
- Publication type:
- Article
3
A polynomial algorithm for the p-centdian problem on a tree.
- Published in:
- Networks, 1998, v. 32, n. 4, p. 255, doi. 10.1002/(SICI)1097-0037(199812)32:4<255::AID-NET2>3.0.CO;2-O
- By:
- Publication type:
- Article
4
Scheduling in broadcast networks.
- Published in:
- Networks, 1998, v. 32, n. 4, p. 233, doi. 10.1002/(SICI)1097-0037(199812)32:4<233::AID-NET1>3.0.CO;2-Z
- By:
- Publication type:
- Article
5
Project scheduling with multiple modes: A comparison of exact algorithms.
- Published in:
- Networks, 1998, v. 32, n. 4, p. 283, doi. 10.1002/(SICI)1097-0037(199812)32:4<283::AID-NET5>3.0.CO;2-I
- By:
- Publication type:
- Article
6
Constructions of large planar networks with given degree and diameter.
- Published in:
- Networks, 1998, v. 32, n. 4, p. 275, doi. 10.1002/(SICI)1097-0037(199812)32:4<275::AID-NET4>3.0.CO;2-G
- By:
- Publication type:
- Article
7
On optimal orientations of Cartesian products of even cycles.
- Published in:
- Networks, 1998, v. 32, n. 4, p. 299, doi. 10.1002/(SICI)1097-0037(199812)32:4<299::AID-NET6>3.0.CO;2-X
- By:
- Publication type:
- Article