Solving the Job Sequencing and Tool Switching Problem as a nonlinear least cost Hamiltonian cycle problem.
- Published in:
- Networks, 2010, v. 55, n. 4, p. 379, doi. 10.1002/net.20341
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2010 AND VI 55 AND IP 4
Results: 7
1
2
A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation.
- Published in:
- Networks, 2010, v. 55, n. 4, p. 299, doi. 10.1002/net.20316
- By:
- Publication type:
- Article
3
Gossiping and routing in undirected triple-loop networks.
- Published in:
- Networks, 2010, v. 55, n. 4, p. 341, doi. 10.1002/net.20327
- By:
- Publication type:
- Article
4
Public congestion network situations and related games.
- Published in:
- Networks, 2010, v. 55, n. 4, p. 368, doi. 10.1002/net.20340
- By:
- Publication type:
- Article
5
Join tree propagation with prioritized messages.
- Published in:
- Networks, 2010, v. 55, n. 4, p. 350, doi. 10.1002/net.20328
- By:
- Publication type:
- Article
6
Minimal selectors and fault tolerant networks.
- Published in:
- Networks, 2010, v. 55, n. 4, p. 326, doi. 10.1002/net.20326
- By:
- Publication type:
- Article
7
Rainbow trees in graphs and generalized connectivity.
- Published in:
- Networks, 2010, v. 55, n. 4, p. 360, doi. 10.1002/net.20339
- By:
- Publication type:
- Article