Refer to the Changelog for info about versions.
This software solves the Delete-Free relaxation of automated planning tasks using Mixed Integer Programming (MIP) formulations. It reads planning problems in SAS+ format and computes optimal solutions using CPLEX.
- UNIX based OS
- cmake 3.20 +
- This software requires as input the SAS file produced by the Fast Downward translator (this software was produced with version 3 of the FD translator as a reference)
While inside the root folder of this repo:
# to build
mkdir code/build
cd code/build
cmake <build_options> ..
make
# to run the code on an instance
./hplus <input_file> <parameters>- -DCPLEX_PATH=<path_to_cplex>: (absolute path), specify a custom path to the CPLEX installation (see the CMakeLists.txt to see which are the default ones (CPLEX_POSSIBLE_PATHS) or append your to that list to avoid specifying it every time)
- **-DCMAKE_BUILD_TYPE=**Debug/Release: Build type (default is Debug), Debug mode enables warnings
See the help page:
# to view commands available
./hplus --hHere's a few examples:
# Run the vertex elimination algorithm with a time limit of 5 min
./hplus problem.sas --a=ve --t=300
# Run the greedy algorithm with the hadd lookahead strategy and no preprocessing
./hplus problem.sas --a=gha --prep=0
# Run the Landmark based model with various customizations
./hplus problem.sas --a=cuts \
--ws=0 \ # Don't use the primal heuristic as warm start
--fract-minlm=0 \ # Don't use the LM minimalization procedure in relax callback
--cloop=1 # Use custom cutloop- Master Thesis (2025): [Thesis]
- AIROYoung Workshop (2026): [Slides]
- IJOO MIP Workshop (2025, under review): [Preprint]
MIT License - see LICENSE for details.