A hybrid genetic algorithm for a dynamic logistics network with multi-commodities and components.
- Published in:
- RAIRO -- Operations Research, 2011, v. 45, n. 2, p. 153, doi. 10.1051/ro/2011105
- By:
- Publication type:
- Article
Works matching IS 03990559 AND DT 2011 AND VI 45 AND IP 2
Results: 4
1
2
Semidefinite Programming Based Algorithms for the Sparsest Cut Problem.
- Published in:
- RAIRO -- Operations Research, 2011, v. 45, n. 2, p. 75, doi. 10.1051/ro/2011104
- By:
- Publication type:
- Article
3
Minmax regret combinatorial optimization problems: an Algorithmic Perspective.
- Published in:
- RAIRO -- Operations Research, 2011, v. 45, n. 2, p. 101, doi. 10.1051/ro/2011111
- By:
- Publication type:
- Article
4
A discrete-time Geo[X]/G/1 retrial queue with general retrial time and M-additional options for service.
- Published in:
- RAIRO -- Operations Research, 2011, v. 45, n. 2, p. 131, doi. 10.1051/ro/2011109
- By:
- Publication type:
- Article