This paper presents a novel algorithm for path planning of point robots in 2D known environment, using binary integer programming. In this approach the problem of path planning is formulated as a ...

This code can be used to compute distributions over the optimal solutions of an integer programming formulation when each of the agents involved can be represented by a single variable (which can be ...

A timetabling problem is formulated as a large integer linear programming problem in 0-1 variables. A solution method based on Lagrangean relaxation coupled with subgradient optimization is presented.

This problem consist of placing a set of VMs on a set of servers, with the goal of minimizing the number of servers used. This is a NP-hard problem, and can be formulated as a Linear Programming ...

We show that the linear relaxation of the new formulation is tighter than that of the standard mixed integer programming formulation. We describe different classes of valid inequalities for the new ...