An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem
- 作者Wilco van den Heuvel; Albert P.M. Wagelmans
- 卷第33卷
- 期第12期
- 印刷ISSN0305-0548
- 文件大小234.04KB
- 发表时间2006
- DOI10.1016/j.cor.2005.02.046
- 页码3583-3599
An approximation algorithm for the traveling tournament problemRyuhei Miyashiro; Tomomi Matsui; Shinji Imahori · 2012
BEST SUBSET SELECTION FOR ELIMINATING MULTICOLLINEARITYTamura, Ryuta; Kobayashi, Ken; Takano, Yuichi; Miyashiro, Ryuhei; Nakata, Kazuhide; Matsui, Tomomi · Journal of the Operations Research Society of Japan · 2017
An Improved Approximation Algorithm for the Traveling Tournament ProblemDaisuke Yamaguchi; Shinji Imahori; Ryuhei Miyashiro; Tomomi Matsui · 2011
A 2.75-approximation algorithm for the unconstrained traveling tournament problemShinji Imahori,Tomomi Matsui,Ryuhei Miyashiro · Annals of Operations Research · 2014
A polynomial-time algorithm to find an equitable home–away assignmentRyuhei Miyashiro; Tomomi Matsui · 2005
Mixed integer quadratic optimization formulations for eliminating multicollinearity based on variance inflation factorTamura, Ryuta; Kobayashi, Ken; Takano, Yuichi; Miyashiro, Ryuhei; Nakata, Kazuhide; Matsui, Tomomi · Journal of Global Optimization · 2018