线性排序问题:最优解的算法

A. Mushi
{"title":"线性排序问题:最优解的算法","authors":"A. Mushi","doi":"10.4314/AJST.V6I1.55167","DOIUrl":null,"url":null,"abstract":"In this paper we describe and implement an algorithm for the exact solution of the Linear Ordering problem. Linear Ordering is the problem of finding a linear order of the nodes of a graph such that the sum of the weights which are consistent with this order is as large as possible. It is an NP - Hard combinatorial optimisation problem with a large number of applications, including triangulation of input - output matrices in Economics, aggregation of individual preferences and ordering of teams in sports. We implement an algorithm for the exact solution using cutting plane and branch and bound procedures. The program developed is then applied to the triangulation problem for the input - output tables. We have been able to triangulate input - output matrices of size up to 41 x 41.","PeriodicalId":7641,"journal":{"name":"African Journal of Science and Technology","volume":"38 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2010-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"The linear ordering problem: an algorithm for the optimal solution\",\"authors\":\"A. Mushi\",\"doi\":\"10.4314/AJST.V6I1.55167\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we describe and implement an algorithm for the exact solution of the Linear Ordering problem. Linear Ordering is the problem of finding a linear order of the nodes of a graph such that the sum of the weights which are consistent with this order is as large as possible. It is an NP - Hard combinatorial optimisation problem with a large number of applications, including triangulation of input - output matrices in Economics, aggregation of individual preferences and ordering of teams in sports. We implement an algorithm for the exact solution using cutting plane and branch and bound procedures. The program developed is then applied to the triangulation problem for the input - output tables. We have been able to triangulate input - output matrices of size up to 41 x 41.\",\"PeriodicalId\":7641,\"journal\":{\"name\":\"African Journal of Science and Technology\",\"volume\":\"38 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-06-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"African Journal of Science and Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4314/AJST.V6I1.55167\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"African Journal of Science and Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4314/AJST.V6I1.55167","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

本文描述并实现了线性排序问题精确解的一种算法。线性排序是寻找图中节点的线性顺序的问题,使得与该顺序一致的权重之和尽可能大。它是一个具有大量应用的NP - Hard组合优化问题,包括经济学中输入-输出矩阵的三角化,个人偏好的聚合和体育运动中的团队排序。我们使用切平面和分支定界法实现了精确解的算法。然后将所开发的程序应用于输入-输出表的三角剖分问题。我们已经能够三角化大小为41 x 41的输入-输出矩阵。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
The linear ordering problem: an algorithm for the optimal solution
In this paper we describe and implement an algorithm for the exact solution of the Linear Ordering problem. Linear Ordering is the problem of finding a linear order of the nodes of a graph such that the sum of the weights which are consistent with this order is as large as possible. It is an NP - Hard combinatorial optimisation problem with a large number of applications, including triangulation of input - output matrices in Economics, aggregation of individual preferences and ordering of teams in sports. We implement an algorithm for the exact solution using cutting plane and branch and bound procedures. The program developed is then applied to the triangulation problem for the input - output tables. We have been able to triangulate input - output matrices of size up to 41 x 41.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Engineering geological assessment of some lateritic soils in Ibadan, south-western Nigeria using bivariate and regression analyses Tabu search heuristic for university course timetabling problem THE INFLUENCE OF PH AND ADSORBENT CONCENTRATION ON ADSORPTION OF LEAD AND ZINC ON A NATURAL GOETHITE Conditional scale function estimate in the presence of unknown conditional quantile function DETERMINATION DE LA QUALITÉ DU PAIN DE SUCRE A PARTIR DES CONCENTRATIONS DES SUCRES REDUCTEURS
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1