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

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.

A major challenge in microarray classification is that the number of features is typically orders of magnitude larger than the number of examples. In this paper, we propose a novel feature filter ...

You can create a release to package software, along with release notes and links to binary files, for other people to use. Learn more about releases in our docs.

A Binary-Integer Linear Programming (BILP) model that solves sudoku puzzles. Linear Programming is done on python that wraps around CPLEX to solve system of linear equations much faster.

The following is a simple mixed integer programming problem. Details can be found in Example 3.8 in the "Examples" section. data; input _row_ $10. choco gumdr ichoco igumdr _type_ $ _rhs_; datalines; ...