A new heuristic algorithm solving the linear ordering problem
- 1 September 1996
- journal article
- Published by Springer Science and Business Media LLC in Computational Optimization and Applications
- Vol. 6 (2), 191-205
- https://doi.org/10.1007/bf00249646
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- On the acyclic subgraph polytopeMathematical Programming, 1985
- A Cutting Plane Algorithm for the Linear Ordering ProblemOperations Research, 1984
- A branch and bound algorithm for the acyclic subgraph problemEuropean Journal of Operational Research, 1981
- Multiple Attribute Decision MakingLecture Notes in Economics and Mathematical Systems, 1981
- Optimal Weighted Ancestry RelationshipsManagement Science, 1974
- Zwei Algorithmen zur Lösung eines komplexen ReihenfolgeproblemsMathematical Methods of Operations Research, 1968