Zobrazeno 1 - 10
of 149
pro vyhledávání: '"Yagiura, Mutsunori"'
Given a set of squares and a strip of bounded width and infinite height, we consider a square strip packaging problem, which we call the square independent packing problem (SIPP), to minimize the strip height so that all the squares are packed into i
Externí odkaz:
http://arxiv.org/abs/2307.06654
Publikováno v:
In Theoretical Computer Science 12 January 2025 1024
Publikováno v:
In European Journal of Operational Research November 2024
Publikováno v:
In Computers and Operations Research January 2024 161
We consider binary integer programming problems with the min-max regret objective function under interval objective coefficients. We propose a new heuristic framework, which we call the iterated dual substitution (iDS) algorithm. The iDS algorithm it
Externí odkaz:
http://arxiv.org/abs/2012.07530
We consider an extension of the set covering problem (SCP) introducing (i)~multicover and (ii)~generalized upper bound (GUB)~constraints. For the conventional SCP, the pricing method has been introduced to reduce the size of instances, and several ef
Externí odkaz:
http://arxiv.org/abs/1705.04970
Autor:
Yagiura, Mutsunori
本文データは平成22年度国立国会図書館の学位論文(博士)のデジタル化実施により作成された画像ファイルを基にpdf変換したものである
Kyoto University (京都大学)
0048
乙第10101号
Kyoto University (京都大学)
0048
乙第10101号
Externí odkaz:
http://hdl.handle.net/2433/157060
Publikováno v:
Journal of Industrial & Management Optimization; May2024, Vol. 20 Issue 5, p1-16, 16p