A Polyhedral Study of Integer Variable Upper Bounds
Lists
Only you see this
Abstract
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 ...
BibTeX
@article{klabjan2002polyhedral,
author = {Diego Klabjan and George L. Nemhauser},
title = {{A Polyhedral Study of Integer Variable Upper Bounds}},
journal = {Math. Oper. Res.},
year = {2002},
doi = {10.1287/moor.27.4.711.300},
}Loading related content...