Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment.
- Published in:
- Networks, 2012, v. 59, n. 2, p. 191, doi. 10.1002/net.20434
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2012 AND VI 59 AND IP 2
Results: 7
1
2
Bidirectional A* search on time-dependent road networks.
- Published in:
- Networks, 2012, v. 59, n. 2, p. 240, doi. 10.1002/net.20438
- By:
- Publication type:
- Article
3
Lagrangean decomposition/relaxation for the routing and wavelength assignment problem.
- Published in:
- Networks, 2012, v. 59, n. 2, p. 226, doi. 10.1002/net.20437
- By:
- Publication type:
- Article
4
A note on Steiner tree games.
- Published in:
- Networks, 2012, v. 59, n. 2, p. 215, doi. 10.1002/net.20436
- By:
- Publication type:
- Article
5
A note on a generalization of eigenvector centrality for bipartite graphs and applications.
- Published in:
- Networks, 2012, v. 59, n. 2, p. 261, doi. 10.1002/net.20442
- By:
- Publication type:
- Article
6
Approximation algorithms for distance constrained vehicle routing problems.
- Published in:
- Networks, 2012, v. 59, n. 2, p. 209, doi. 10.1002/net.20435
- By:
- Publication type:
- Article
7
The complexity of welfare maximization in congestion games.
- Published in:
- Networks, 2012, v. 59, n. 2, p. 252, doi. 10.1002/net.20439
- By:
- Publication type:
- Article