TY  - JOUR
AU  - Muenvanichakul, Sirirat 
AU  - Charnsethikul, Peerayuth 
PY  - 2010
TI  - Two Reformulations for the Dynamic Quadratic Assignment Problem
JF  - Journal of Mathematics and Statistics
VL  - 6
IS  - 4
DO  - 10.3844/jmssp.2010.449.453
UR  - https://thescipub.com/abstract/jmssp.2010.449.453
AB  - Problem statement: The Dynamic Quadratic Assignment Problem (DQAP), an NP-hard problem, is outlined and reformulated in two alternative models: Linearized model and logic-based model. Approach: The solution methods for both models based on combinatorial methods (Benders’ Decomposition and Approximate Dynamic Programming) and constraint logic programming, respectively, are proposed. Results: Proofs of model equivalence and solution methodology are presented. Conclusion: Both proposed models are more simplified leading to possible hybrid adaptations of existing techniques for more practical approaches.