Art

J-GLOBAL ID：202002253074844244   Reference number：20A0527647

Conic relaxation approaches for equal deployment problems

等配置問題のための円錐緩和法【JST・京大機械翻訳】

Author (4)： Safarina Sena (Department of Mathematical and Computing Science, Tokyo Institute of Technology, 2-12-1-W8-29 Ookayama, Meguro-ku, Tokyo 152-8552, Japan) ,  Moriguchi Satoko (Faculty of Economics and Business Administration, Tokyo Metropolitan University, 1-1 Minami-Osawa, Hachioji-shi, Tokyo 192-0397, Japan) ,  Mullin Tim J. (The Swedish Forestry Research Institute (Skogforsk), Box 3, Saevar 918 21, Sweden; and 224 rue du Grand-Royal Est, QC, J2M 1R5, Canada) ,  Yamashita Makoto (Department of Mathematical and Computing Science, Tokyo Institute of Technology, 2-12-1-W8-29 Ookayama, Meguro-ku, Tokyo 152-8552, Japan)
Material： Discrete Applied Mathematics  (Discret Appl Math)
Volume： 275  Page： 111-125  Publication year： 2020 
JST Material Number： A1227A  ISSN： 0166-218X  Document type： Article
Article type： 原著論文  Country of issue： Netherlands (NLD)  Language： ENGLISH (EN)

Abstract/Point： An important problem in the br...

Register(free) or Log In to access     To see more with JDream III (charged).   {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=20A0527647&from=J-GLOBAL&jstjournalNo=A1227A") }}

Thesaurus term： circular cone ,  Heredity ,  crop (agriculture) ,  forest tree ,  *relaxation method ,  linear programming ,  selection problem ,  breeding(genetics) ,  *relaxation phenomenon ,  *location problem ,  convexity ,  domestic animal ,  Genotype ,  convex optimization ,  optimal solution

Author keywords (6)： Semidefinite programming ,  Second-order cone programming ,  Mixed-integer conic programming ,  Conic relaxation ,  Tree breeding ,  Equal deployment problem

JST classification (5)： Theory of computation  (JB02000A) ,  Basics of graph theory  (IA02020S) ,  Structure and chemistry of genes  (EC02020U) ,  Network methods  (KA03040X) ,  Process control  (KB03030P)

Terms in the title (3)： 配置問題 ,  円錐 ,  緩和法