Integer programming, a cornerstone of combinatorial optimisation, focuses on the selection of discrete decision variables to solve complex real‐world problems such as scheduling, network design and ...
This is a preview. Log in through your library . Abstract In this note we use the concept of intersection cut, introduced by Balas for integer programming problems, to develop a cutting-plane ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback