Constraint Programming (CP) has been successful in a number of combinatorial search and discrete optimisation problems. Yet other more traditional approaches, such as Integer Programming (IP), can ...

Linear semi-infinite programming (LSIP) is a branch of optimisation that focuses on problems where a finite number of decision variables is subject to infinitely many linear constraints. This ...

Roth, A. E., U. G. Rothblum, and J. H. Vande Vate. "Stable Matchings, Optimal Assignments, and Linear Programming." Mathematics of Operations Research 18, no. 4 ...

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 ...