Variable neighborhood search for the linear ordering problem-Reference-Cited by-同舟云学术

Variable neighborhood search for the linear ordering problem

Published:2006-12 Issue:12 Volume:33 Page:3549-3565
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

Garcia Carlos G.,Pérez-Brito Dionisio,Campos Vicente,Martí Rafael

Publisher

Elsevier BV

Subject

Management Science and Operations Research,Modeling and Simulation,General Computer Science

Reference15 articles.

1. An introduction to variable neighborhood search;Hansen,1999

2. International comparisons of the structure of production;Chenery;Econometrica,1958

3. Becker O. Das Helmstädtersche Reihenfolgeproblem—die Effizienz verschiedener Näherungsverfahren. Computer uses in the social sciences, Berichteiner Working Conference, Wien, 1967.

4. A cutting plane algorithm for the linear ordering problem;Grotschel;Operations Research,1984

5. The linear ordering problem: algorithms and applications;Reinelt,1985

Cited by 42 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Comprehensive learning TLBO with recursive precedence-based solution construction and multilevel local search for the linear ordering problem;Expert Systems with Applications;2024-03

2. Cumulative Capacitated Colored Traveling Salesman Problem;IEEE Transactions on Cybernetics;2023

3. A diversity-aware memetic algorithm for the linear ordering Problem;Memetic Computing;2022-10-16

4. An efficient tabu search algorithm for the linear ordering problem;Journal of Advanced Mechanical Design, Systems, and Manufacturing;2022

5. Integer Linear Programming Reformulations for the Linear Ordering Problem;Communications in Computer and Information Science;2022