The following pages link to Francisco Parreño (Q1871418):
Displaying 20 items.
- (Q336707) (redirect page) (← links)
- A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems (Q336709) (← links)
- A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing (Q610979) (← links)
- Logistic constraints in container loading problems: the impact of complete shipment conditions (Q828763) (← links)
- Reactive GRASP for the strip-packing problem (Q941532) (← links)
- A branch and bound algorithm for the strip packing problem (Q1017971) (← links)
- Solving a large multicontainer loading problem in the car manufacturing industry (Q1652277) (← links)
- A tabu search algorithm for the pallet loading problem (Q1764209) (← links)
- A branch-and-cut algorithm for the pallet loading problem (Q1781574) (← links)
- A tabu search algorithm for assigning teachers to courses. (Q1871419) (← links)
- Measuring diversity. A review and an empirical analysis (Q2029033) (← links)
- Solving a large cutting problem in the glass manufacturing industry (Q2189955) (← links)
- Lower bounds for three-dimensional multiple-bin-size bin packing problems (Q2260892) (← links)
- Neighborhood structures for the container loading problem: a VNS implementation (Q2267814) (← links)
- A tabu search algorithm for a two-dimensional non-guillotine cutting problem (Q2643950) (← links)
- The pallet-loading vehicle routing problem with stability constraints (Q2672112) (← links)
- A beam search algorithm for minimizing crane times in premarshalling problems (Q2672129) (← links)
- Determining the best shipper sizes for sending products to customers (Q2803267) (← links)
- A Maximal-Space Algorithm for the Container Loading Problem (Q2901024) (← links)
- A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems (Q4679787) (← links)
