Valid inequalities for mixed 0-1 programs
Discrete Applied Mathematics
Valid inequalities for 0–1 knapsacks and mips with generalised upper bound constraints
Selected papers on First international colloquium on pseudo-boolean optimization and related topics
Capacitated facility location: separation algorithms and computational experience
Mathematical Programming: Series A and B - Special issue on computational integer programming
| Hi-index | 0.00 |
We study the polyhedron of the single node capacitated network design model with integer variable upper bounds. We first give a characterization of valid inequalities that is useful in proving the validity of several classes of inequalities. Next we derive several classes of valid inequalities and we give conditions for them to be facet-defining. Sequence independent lifting is used to obtain additional facets. We conclude by reporting computational results with a branch-and-cut algorithm.