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...
Spremljeno u:
| Izdano u: | URI:https://journals.openedition.org/msh, |
|---|---|
| Glavni autori: | , |
| Format: | Article ou chapitre numérique |
| Jezik: | Français |
| Izdano: |
Mathématiques et sciences humaines
2006
|
| Online pristup: | Accès Université d'Orléans et IFPM Accès Université d'Orléans et IFPM |