A Hybrid Genetic Algorithm for Constrained Combinatorial Problems: An Application to Promotion Planning Problems

DOI10.1007/978-3-642-20009-0_48zbMath1421.90179OpenAlexW1548176592MaRDI QIDQ5232832

Paulo A. A. Pereira, Dalila B. M. M. Fontes, Fernando A. C. C. Fontes

Publication date: 13 September 2019

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: https://repositorio-aberto.up.pt/handle/10216/70367

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• A genetic algorithm for the multidimensional knapsack problem
• A Decision Support System for Planning Promotion Time Slots
• A Bibliographical Survey On Some Well-Known Non-Standard Knapsack Problems

This page was built for publication: A Hybrid Genetic Algorithm for Constrained Combinatorial Problems: An Application to Promotion Planning Problems