Abstract
In this paper, we discuss solution approaches to the important but difficult class of all-integer programming problems that are highly primal and dual-degenerate. In particular, we note our success with an “objective function cut” in this regard, and exhibit a computational comparison with other cutting plane techniques.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
