Efficient local search algorithms for the linear ordering problem
Article first published online: 5 OCT 2010
© 2010 The Authors. International Transactions in Operational Research © 2010 International Federation of Operational Research Societies
International Transactions in Operational Research
Special Issue: Applied Combinatorial Optimization: Guest Edited by Paula Zabala and Isabel Mendez-Diaz
Volume 17, Issue 6, pages 711–737, November 2010
How to Cite
Sakuraba, C. S. and Yagiura, M. (2010), Efficient local search algorithms for the linear ordering problem. International Transactions in Operational Research, 17: 711–737. doi: 10.1111/j.1475-3995.2010.00778.x
- Issue published online: 15 OCT 2010
- Article first published online: 5 OCT 2010
- Received 20 January 2009; received in revised form 17 March 2010; accepted 24 March 2010
Options for accessing this content:
- If you are a society or association member and require assistance with obtaining online access instructions please contact our Journal Customer Services team.
- If your institution does not currently subscribe 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)
- 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!