An exact algorithm for large unbounded knapsack problems
- 作者Silvano Martello; Paolo Toth
- 卷第9卷
- 期第1期
- 印刷ISSN0167-6377
- 文件大小390.95KB
- 发表时间1990
- DOI10.1016/0167-6377(90)90035-4
- 页码15-20
Uncapacitated two-level lot-sizingRafael A. Melo; Laurence A. Wolsey · 2010
Optimizing constrained subtrees of treesEl Houssaine Aghezzaf; Thomas L. Magnanti; Laurence A. Wolsey · Mathematical Programming · 1995
Approximate extended formulationsMathieu Van Vyve; Laurence A. Wolsey · Mathematical Programming · 2006
The continuous knapsack setDash, Sanjeeb; Günlük, Oktay; Wolsey, Laurence A. · Mathematical Programming · 2016
The Mixing Set with FlowsConforti, Michele; Di Summa, Marco; Wolsey, Laurence A. · SSRN Electronic Journal · 2005
Lot-sizing on a treeMarco Di Summa; Laurence A. Wolsey · 2008
Fractional covers for forests and matchingsManfred W. Padberg; Laurence A. Wolsey · Mathematical Programming · 1984
The Mixing Set with FlowsConforti, Michele; Di Summa, Marco; Wolsey, Laurence A. · SIAM Journal on Discrete Mathematics · 2007