A heuristic and an exact method for the gate matrix connection cost minimization problem
Article first published online: 24 JUN 2013
© 2013 The Authors. International Transactions in Operational Research © 2013 International Federation of Operational Research Societies
International Transactions in Operational Research
Special Issue: Contributions to Applied Combinatorial Optimization
Volume 20, Issue 5, pages 627–643, September 2013
How to Cite
De Giovanni, L., Massi, G., Pezzella, F., Pfetsch, M.E., Rinaldi, G. and Ventura, P. (2013), A heuristic and an exact method for the gate matrix connection cost minimization problem. International Transactions in Operational Research, 20: 627–643. doi: 10.1111/itor.12025
- Issue published online: 30 JUL 2013
- Article first published online: 24 JUN 2013
- Manuscript Accepted: 22 APR 2013
- Manuscript Revised: 19 APR 2013
- Manuscript Received: 15 OCT 2011
Options for accessing this content:
- If you have access to this content through a society membership, please first log in to your society website.
- If you would like institutional access to this content, please recommend the title to your librarian.
- Login via other institutional login options http://onlinelibrary.wiley.com/login-options.
- You can purchase online access to this Article for a 24-hour period (price varies by title)
- If you already have a Wiley Online Library or Wiley InterScience user account: login above and proceed to purchase the article.
- New Users: Please register, then proceed to purchase the article.
Login via OpenAthens
Search for your institution's name below to login via Shibboleth.
Registered Users please login:
- Access your saved publications, articles and searches
- Manage your email alerts, orders and subscriptions
- Change your contact information, including your password
Please register to:
- Save publications, articles and searches
- Get email alerts
- Get all the benefits mentioned below!