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.

It has been demonstrated that Binary Integer Programming (BIP) formulations can be reformulated to a corresponding quadratic unconstrained binary optimization (QUBO) problem. The reformulation allows ...

There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.