Author:
Pochet Yves,Wolsey Laurence A.
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference6 articles.
1. Integer programming solutions for capacity expansion of the local access network, TM-ARH-017914;Cook,1990
2. Capacity expansion of the local access network, Core;Gailly,1991
3. Some polyhedra related to combinatorial problems;Gomory;Linear Algebra Appl.,1969
4. When the greedy solution solves a class of knapsack problems;Magazine;Oper. Res.,1975
5. The cutting stock problem and integer rounding;Marcotte;Math. Programming,1985
Cited by
42 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Lifting for the integer knapsack cover polyhedron;Journal of Global Optimization;2022-12-07
2. Facility Location-Allocation Problem for Emergency Medical Service With Unmanned Aerial Vehicle;IEEE Transactions on Intelligent Transportation Systems;2022
3. A new upper bound for the multiple knapsack problem;Computers & Operations Research;2021-05
4. Multicommodity Multifacility Network Design;Network Design with Applications to Transportation and Logistics;2020-12-09
5. Knapsack polytopes: a survey;Annals of Operations Research;2019-09-19