This digital document is an article from Journal of Computer Science, published by Science Publications on January 1, 2009. The length of the article is 4533 words. The page length shown above is based on a typical 300-word page. The article is delivered in HTML format and is available immediately after purchase. You can view it with any web browser.
From the author: Key words: Dynamic quadratic assignment, benders decomposition, dynamic programming, trust region method
Citation Details
Title: Benders' Decomposition based heuristics for large-scale dynamic quadratic assignment problems.(Report)
Author: Sirirat Muenvanichakul
Publication:Journal of Computer Science (Magazine/Journal)
Date: January 1, 2009
Publisher: Science Publications
Volume: 5 Issue: 1 Page: 64(7)
Article Type: Report
Distributed by Gale, a part of Cengage Learning
Benders' Decomposition based heuristics for large-scale dynamic quadratic assignment problems.(Report): An article from: Journal of Computer Science
📄 Viewing lite version
Full site ›
⌛ 🇫🇷 France pricing being fetched…
Prices will appear once fetched — usually within a few minutes.
View in:
🇺🇸 USA
Book Details
PublisherScience Publications
ISBN / ASINB002QWSV1K
ISBN-13978B002QWSV17
MarketplaceFrance 🇫🇷