Packing with Complex Shapes
Résumé
Constraint programming methods can be used to solve hard geometric placement and packing problems such as those encountered in the operational logistics and in the conception of packing plans.
Sylvain Soliman : Connectez-vous pour contacter le contributeur
https://hal.science/hal-01378471
Soumis le : jeudi 10 novembre 2016-16:03:28
Dernière modification le : mardi 17 septembre 2024-15:58:39