Packing with Complex Shapes

Abderrahmane Aggoun,Nicolas Beldiceanu,Gilles Chabert,François Fages

Packing with Complex Shapes

2016

Abderrahmane Aggoun
Nicolas Beldiceanu
Gilles Chabert
François Fages

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.

Keywords:

Constraint programming
Packing problems
Mathematical optimization
Computer science

Correction
Source
Cite
Save
Machine Reading By IdeaReader

References

Citations