In this paper we consider a class of parallel machine scheduling problems and their associated set-partitioning formulations. We show that the tightness of the linear programming relaxation of these ...
In this note we construct some counterexamples concerning upper semicontinuity and linear upper and lower semicontinuity of the solution sets and ε -solution sets of nonlinear programming programs: ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback