The linear ordering problem revisited
Authors:
- Josu CeberioJCJosu Ceberio
- Alexander MendiburuAMAlexander Mendiburu
- Jose A. LozanoJLJose A. Lozano
- 1 March 2015
- journal article
- research article
- Published by Elsevier in European Journal of Operational Research
- Vol. 241 (3) , 686-696
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Average parameterization and partial kernelization for computing mediansJournal of Computer and System Sciences, 2011
- Variable neighborhood search for the linear ordering problemComputers & Operations Research, 2006
- A branch-and-bound algorithm to solve the linear ordering problem for weighted tournamentsDiscrete Applied Mathematics, 2006
- The Linear Ordering Problem: Instances, Search Space Analysis and AlgorithmsJournal of Mathematical Modelling and Algorithms, 2004
- Metaheuristics in combinatorial optimizationACM Computing Surveys, 2003
- Intensification and diversification with elite tabu search solutions for the linear ordering problemComputers & Operations Research, 1999
- A new heuristic algorithm solving the linear ordering problemComputational Optimization and Applications, 1996
- A branch and bound algorithm for the acyclic subgraph problemEuropean Journal of Operational Research, 1981
- La hiérarchie des industries dans un tableau des échanges interindustrielsRevue économique, 1960
- International Comparisons of the Structure of ProductionEconometrica, 1958