Problème NP difficile And NotDamien Stehle
List of bibliographic references
Number of relevant bibliographic references: 7.| Ident. | Authors (with country if any) | Title |
|---|---|---|
| 000121 | Dilip Datta [Inde, Portugal] ; Andre R. S. Amaral [Portugal] ; Jose Rui Figueira [France] | Single row facility layout problem using a permutation-based genetic algorithm |
| 000229 | A. Bellanger [France] ; A. Oulamara [France] | Scheduling hybrid flowshop with parallel batching machines and compatibilities |
| 000358 | Julien Fondrevelle [France] ; Ammar Oulamara [France] ; Marie-Claude Portmann [France] | Permutation flowshop scheduling problems with maximal and minimal time lags |
| 000362 | Johanne Cohen [France] ; Fedor Fomin [Norvège] ; Pinar Heggemes [Norvège] ; Dieter Kratsch [France] ; Gregory Kucherov [France] | Optimal linear arrangement of interval graphs |
| 000680 | Michaël Rusinowitch [France] ; Mathieu Turuani [France] | Protocol insecurity with a finite number of sessions and composed keys is NP-complete |
| 000735 | N. N. Pisaruk [France] | A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time |
| 000A90 | L. Juban [France] | Dichotomy theorem for the generalized unique satisfiability problem |
| This area was generated with Dilib version V0.6.33. |  |