Approximation polynomiale des problèmes NP-difficiles : optima locaux et rapport différentiel
Gespeichert in:
| Hauptverfasser: | Monnot, Jérôme, Paschos, Vangelis T. (VerfasserIn), Toulouse, Sophie (VerfasserIn) |
|---|---|
| Format: | Livre papier |
| Sprache: | Français |
| Veröffentlicht: |
Paris :
Hermès Science : Lavoisier
C 2003.
|
| Schlagworte: | |
| Autres localisations: | Voir dans le Sudoc |
Ähnliche Einträge
- Approximation algorithms for combinatorial optimization : 5th international workshop, APPROX 2002, Rome, Italy, September 17-21, 2002 : proceedings (Livre numérique)
- Approximation algorithms for combinatorial optimization : international workshop, APPROX '98, Aalborg, Denmark, July 18-19, 1998 : proceedings (Livre numérique)
- Approximation, randomization, and combinatorial optimization : algorithms and techniques : 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001 Berkeley, CA, USA, August 18 20, 2001 : proceedings (Livre numérique)
- Approximation, randomization, and combinatorial optimization : algorithms and techniques : 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeton, NJ, USA, August 24-26, 2003 : proceedings (Livre numérique)
-
Metaheuristics for hard optimization : simulated annealing, tabu search, evolutionary and genetic algorithms, ant colonies, methods and case studies
(Livre numérique)
Dréo, Johann, 1978-, et al.
Springer Berlin Heidelberg, 2006

