Valeurs extrémales d'un problème d'optimisation combinatoire et approximation polynomiale
As a subsequence of some of our previous works on complexity and polynomial approximation theory, we present some further reflections and arguments about extremal, optimal and worst, values (and solutions) of combinatorial optimization problems. This discussion leads us to consider a constant source...
Salvato in:
| Pubblicato in: | URI:https://journals.openedition.org/msh, |
|---|---|
| Autori principali: | , |
| Natura: | Article ou chapitre numérique |
| Lingua: | Français |
| Pubblicazione: |
Mathématiques et sciences humaines
2006
|
| Accesso online: | Accès Université d'Orléans et IFPM Accès Université d'Orléans et IFPM |