{"title":"0-1整数规划在轨道装配问题中的应用","authors":"C. Morefield","doi":"10.1109/CDC.1975.270725","DOIUrl":null,"url":null,"abstract":"Multiple-target tracking in high target density situations can be posed as a multi-hypothesis decision problem. The complete solution of such problems on a real time basis requires that the computations be carried out in a computer-efficient manner. This paper discusses a formulation of the tracking problem based on 0-1 integer programming which can markedly reduce Computer time requirements.","PeriodicalId":164707,"journal":{"name":"1975 IEEE Conference on Decision and Control including the 14th Symposium on Adaptive Processes","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1975-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Application of 0-1 integer programming to a track assembly problem\",\"authors\":\"C. Morefield\",\"doi\":\"10.1109/CDC.1975.270725\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Multiple-target tracking in high target density situations can be posed as a multi-hypothesis decision problem. The complete solution of such problems on a real time basis requires that the computations be carried out in a computer-efficient manner. This paper discusses a formulation of the tracking problem based on 0-1 integer programming which can markedly reduce Computer time requirements.\",\"PeriodicalId\":164707,\"journal\":{\"name\":\"1975 IEEE Conference on Decision and Control including the 14th Symposium on Adaptive Processes\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1975-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1975 IEEE Conference on Decision and Control including the 14th Symposium on Adaptive Processes\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CDC.1975.270725\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1975 IEEE Conference on Decision and Control including the 14th Symposium on Adaptive Processes","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDC.1975.270725","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Application of 0-1 integer programming to a track assembly problem
Multiple-target tracking in high target density situations can be posed as a multi-hypothesis decision problem. The complete solution of such problems on a real time basis requires that the computations be carried out in a computer-efficient manner. This paper discusses a formulation of the tracking problem based on 0-1 integer programming which can markedly reduce Computer time requirements.