{"title":"基于多面体规划方法的离散截获问题研究","authors":"A. Filimonov, N. Filimonov","doi":"10.1109/APEIE.2000.913100","DOIUrl":null,"url":null,"abstract":"The minimax and maximin problems of polyhedral programming with cost functions having the structure of polyhedral metric are discussed. The results are used for research on the discrete multistep interception game.","PeriodicalId":184476,"journal":{"name":"2000 5th International Conference on Actual Problems of Electronic Instrument Engineering Proceedings. APEIE-2000. Devoted to the 50th Anniversary of Novosibirsk State Technical University. Vol.1 (Cat","volume":"2007 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Discrete interception problem research by methods of polyhedral programming\",\"authors\":\"A. Filimonov, N. Filimonov\",\"doi\":\"10.1109/APEIE.2000.913100\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The minimax and maximin problems of polyhedral programming with cost functions having the structure of polyhedral metric are discussed. The results are used for research on the discrete multistep interception game.\",\"PeriodicalId\":184476,\"journal\":{\"name\":\"2000 5th International Conference on Actual Problems of Electronic Instrument Engineering Proceedings. APEIE-2000. Devoted to the 50th Anniversary of Novosibirsk State Technical University. Vol.1 (Cat\",\"volume\":\"2007 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-09-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2000 5th International Conference on Actual Problems of Electronic Instrument Engineering Proceedings. APEIE-2000. Devoted to the 50th Anniversary of Novosibirsk State Technical University. Vol.1 (Cat\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/APEIE.2000.913100\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2000 5th International Conference on Actual Problems of Electronic Instrument Engineering Proceedings. APEIE-2000. Devoted to the 50th Anniversary of Novosibirsk State Technical University. Vol.1 (Cat","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APEIE.2000.913100","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Discrete interception problem research by methods of polyhedral programming
The minimax and maximin problems of polyhedral programming with cost functions having the structure of polyhedral metric are discussed. The results are used for research on the discrete multistep interception game.