
doi: 10.1007/bf01585725
The authors present various classes of valid inequalities and study properties of facet defining inequalities for the polytope associated with the generalized assignment problem. It is proved that a basic fractional solution to the linear programming relaxation can be eliminated by a facet associated with an individual knapsack constraint.
knapsack, Linear programming, Polytopes and polyhedra, polytope, Boolean programming, facet defining inequalities, valid inequalities, generalized assignment
knapsack, Linear programming, Polytopes and polyhedra, polytope, Boolean programming, facet defining inequalities, valid inequalities, generalized assignment
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 30 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
