0-1 integer linear programming approximation algorithms

Question

Hi I am looking for an approximation algorithm for 0-1 integer linear programming. Currently the approximation algorithms I find need to relax the interval to be [0,1]. However, my problem can only treat 0 or 1 as the solution.

Does anyone have ideas? Thank you in advance.

Answer 1

The classic procedure to obtain an integral solution would be branch-and-bound. If this is not what you are looking fore, provide more details.