A standalone local search solver for general integer linear programming
The 3 folder:
bin
: precompiled solverSource_Code
: source code of the solverStatistics_and_Results
: detail benchmark statistics and experiment result in the paper.
We provide the precompiled solver, you could easily run it as follow. In order to run Local-ILP, you need to give the path to the input file (in MPS format), and the cutoff time (in seconds).
cd bin
chmod a+x Local-ILP
./Local-ILP --instance=<input_file_name.mps> --cutoff=<cutoff_time>
We provide the source code, so you can also compile and run it as follow.
Example: To run the instance 2club200v15p5scn.mps
in the 10
second time limit.
cd Source_Code
mkdir build
cd src
chmod a+x run
./run --instance=2club200v15p5scn.mps --cutoff=10
If you use Local-ILP in an academic context, please acknowledge this and cite the following article.
Peng Lin, Shaowei Cai, Mengchuan Zou, and Jinkun Lin. New characterizations and efficient local search for general integer linear programming. arXiv preprint arXiv:2305.00188, 2023.
- https://miplib.zib.de/instance_details_sorrell7.html
- https://miplib.zib.de/instance_details_supportcase22.html
- https://miplib.zib.de/instance_details_cdc7-4-3-2.html
- https://miplib.zib.de/instance_details_ns1828997.html
- https://miplib.zib.de/instance_details_scpm1.html
- https://miplib.zib.de/instance_details_scpn2.html