| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1142541 | Operations Research Letters | 2010 | 5 Pages |
Abstract
Interval-gradient cuts are (nonlinear) valid inequalities derived from continuously differentiable nonconvex constraints. In this paper we define interval-subgradient cuts, a generalization to nondifferentiable constraints, and show that no-good cuts with 1-norm are a special case of interval-subgradient cuts. We then briefly discuss what happens if other norms are used.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti, Andrea Lodi,