Revised GRASP with path-relinking for the linear ordering problem
Author
Abstract
Suggested Citation
DOI: 10.1007/s10878-010-9306-x
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Leung, J. & Lee, J., 1994. "More facets from fences for linear ordering and acyclic subgraph polytopes," LIDAM Reprints CORE 1087, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Vicente Campos & Manuel Laguna & Rafael Martí, 2005. "Context-Independent Scatter and Tabu Search for Permutation Problems," INFORMS Journal on Computing, INFORMS, vol. 17(1), pages 111-122, February.
- Wanpracha Chaovalitwongse & Dukwon Kim & Panos M. Pardalos, 2003. "GRASP with a New Local Search Scheme for Vehicle Routing Problems with Time Windows," Journal of Combinatorial Optimization, Springer, vol. 7(2), pages 179-207, June.
- Martin Grötschel & Michael Jünger & Gerhard Reinelt, 1984. "A Cutting Plane Algorithm for the Linear Ordering Problem," Operations Research, INFORMS, vol. 32(6), pages 1195-1220, December.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Kim, Jiyoung & Nakano, Satoshi & Nishimura, Kazuhiko, 2016. "Productivity growth and the structure of production," IDE Discussion Papers 624, Institute of Developing Economies, Japan External Trade Organization(JETRO).
- Satoshi Nakano & Kazuhiko Nishimura, 2017. "Structural propagation in a production network with restoring substitution elasticities," Papers 1701.02216, arXiv.org, revised Apr 2018.
- Kim, Jiyoung & Nakano, Satoshi & Nishimura, Kazuhiko, 2017. "Multifactor CES elasticity and productivity growth : a cross-sectional approach," IDE Discussion Papers 632, Institute of Developing Economies, Japan External Trade Organization(JETRO).
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Irène Charon & Olivier Hudry, 2010. "An updated survey on the linear ordering problem for weighted or unweighted tournaments," Annals of Operations Research, Springer, vol. 175(1), pages 107-158, March.
- P. Detti & D. Pacciarelli, 2001. "A branch and bound algorithm for the minimum storage‐time sequencing problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(4), pages 313-331, June.
- Jose Apesteguia & Miguel A. Ballester, 2015.
"A Measure of Rationality and Welfare,"
Journal of Political Economy, University of Chicago Press, vol. 123(6), pages 1278-1310.
- Jose Apesteguia & Miguel Angel Ballester, 2010. "A measure of rationality and welfare," Economics Working Papers 1220, Department of Economics and Business, Universitat Pompeu Fabra, revised Oct 2014.
- Jose Apesteguia & Miguel Ángel Ballester, 2014. "A Measure of Rationality and Welfare," Working Papers 573, Barcelona School of Economics.
- Jose Apesteguia & Miguel Ángel Ballester, 2010. "A Measure of Rationality and Welfare," Working Papers 467, Barcelona School of Economics.
- Miles William W & Fowks Gary T & Coulter Lisa O, 2010. "AccuV College Football Ranking Model," Journal of Quantitative Analysis in Sports, De Gruyter, vol. 6(3), pages 1-17, July.
- Akbari, Sina & Escobedo, Adolfo R., 2023. "Beyond kemeny rank aggregation: A parameterizable-penalty framework for robust ranking aggregation with ties," Omega, Elsevier, vol. 119(C).
- Angel Juan & Javier Faulin & Albert Ferrer & Helena Lourenço & Barry Barrios, 2013. "MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 21(1), pages 109-132, April.
- Potts, C. N. & Whitehead, J. D., 2001. "Workload balancing and loop layout in the design of a flexible manufacturing system," European Journal of Operational Research, Elsevier, vol. 129(2), pages 326-336, March.
- Manfred Padberg, 2005. "Classical Cuts for Mixed-Integer Programming and Branch-and-Cut," Annals of Operations Research, Springer, vol. 139(1), pages 321-352, October.
- Fung, Richard Y.K. & Liu, Ran & Jiang, Zhibin, 2013. "A memetic algorithm for the open capacitated arc routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 50(C), pages 53-67.
- Aardal, K. & van Hoesel, C.P.M., 1995. "Polyhedral techniques in combinatorial optimization," Research Memorandum 014, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
- Daniel Porumbel & Jin-Kao Hao, 2020. "Distance-guided local search," Journal of Heuristics, Springer, vol. 26(5), pages 711-741, October.
- Fred Glover & Gary Kochenberger & Weihong Xie & Jianbin Luo, 2019. "Diversification methods for zero-one optimization," Journal of Heuristics, Springer, vol. 25(4), pages 643-671, October.
- Vicky Mak & Andreas Ernst, 2007. "New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 66(1), pages 69-98, August.
- B. Jay Coleman, 2005. "Minimizing Game Score Violations in College Football Rankings," Interfaces, INFORMS, vol. 35(6), pages 483-496, December.
- Dietzenbacher, Erik & Yan, Bingqian, 2024. "Explaining the direction of emissions embodied in trade from hypotheses based on country rankings11Funding information: Bingqian Yan received financial support from the National Natural Science Founda," Energy Economics, Elsevier, vol. 129(C).
- Elena Fernández & Justo Puerto & Antonio Rodríguez-Chía, 2013. "On discrete optimization with ordering," Annals of Operations Research, Springer, vol. 207(1), pages 83-96, August.
- Vicente Campos & Manuel Laguna & Rafael Martí, 2005. "Context-Independent Scatter and Tabu Search for Permutation Problems," INFORMS Journal on Computing, INFORMS, vol. 17(1), pages 111-122, February.
- Rajeev Kohli & Khaled Boughanmi & Vikram Kohli, 2019. "Randomized Algorithms for Lexicographic Inference," Operations Research, INFORMS, vol. 67(2), pages 357-375, March.
- A. D. López-Sánchez & J. Sánchez-Oro & M. Laguna, 2021. "A New Scatter Search Design for Multiobjective Combinatorial Optimization with an Application to Facility Location," INFORMS Journal on Computing, INFORMS, vol. 33(2), pages 629-642, May.
- Javier Alcaraz & Eva M. García-Nové & Mercedes Landete & Juan F. Monge, 2020. "The linear ordering problem with clusters: a new partial ranking," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 28(3), pages 646-671, October.
More about this item
Keywords
Linear ordering problem; Heuristic; GRASP; Path-relinking;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:22:y:2011:i:4:d:10.1007_s10878-010-9306-x. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.