![Theoretical computer science / Operations research / Mathematical optimization / Combinatorial optimization / Discrete geometry / Bin packing problem / Packing problem / Genetic algorithm / Cutting stock problem / Mathematics / Applied mathematics / Packaging Theoretical computer science / Operations research / Mathematical optimization / Combinatorial optimization / Discrete geometry / Bin packing problem / Packing problem / Genetic algorithm / Cutting stock problem / Mathematics / Applied mathematics / Packaging](https://www.pdfsearch.io/img/cb8304bcf250d09d5689de3fecdcf1f8.jpg)
| Open Document File Size: 406,79 KBShare Result on Facebook
City Porto / / Company AT&T / Elsevier B.V. / / Country United States / / / IndustryTerm unified tabu search code / genetic algorithm / industrial applications / constructive heuristic algorithm / biased random-key genetic algorithm / tabu search algorithm / constructive and meta-heuristic algorithms / iterative solution / tabu search algorithms / biased random key genetic algorithm / / Organization Universidade do Porto / / Person José Fernando Gonçalves / Roberto Frias / Mauricio G.C. Resende / / / Position Corresponding author / / ProvinceOrState New Jersey / / Technology constructive heuristic algorithm / Bin packing Genetic algorithm / biased random key genetic algorithm / proposed algorithm / hybrid GRASP/VND algorithm / two-level tabu search algorithm / biased random-key genetic algorithm / tabu search algorithms / constructive and meta-heuristic algorithms / genetic algorithm / / URL www.elsevier.com/locate/ijpe / http /
SocialTag |