@article {10.3844/jmssp.2010.449.453,
article_type = {journal},
title = {Two Reformulations for the Dynamic Quadratic Assignment Problem},
author = {Muenvanichakul, Sirirat and Charnsethikul, Peerayuth},
volume = {6},
year = {2010},
month = {Dec},
pages = {449-453},
doi = {10.3844/jmssp.2010.449.453},
url = {https://thescipub.com/abstract/jmssp.2010.449.453},
abstract = {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.},
journal = {Journal of Mathematics and Statistics},
publisher = {Science Publications}
}