Automatic Logic-Based Benders Decomposition with MiniZinc
Authors: Toby Davies, Graeme Gange, Peter Stuckey
AAAI 2017 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | We compare our implementation of this approach to CP and MIP solvers on 4 different problem classes where LBBD has been applied before. . . . We have implemented the described approach, modifying the assumption interface of CHUFFED, a lazy clause generation solver, to report feasibility cuts. We evaluated the approach on several sets of scheduling problems, described below. For each class, we tested Chuffed (CP) (Chu 2011), Gurobi 6.5 (MIP) (Gurobi 2016) and our logic based Benders decomposition approach (LBBD). |
| Researcher Affiliation | Academia | Toby O. Davies, Graeme Gange, Peter J. Stuckey Department of Computing and Information Systems The University of Melbourne, Victoria 3010, Australia |
| Pseudocode | Yes | Figure 1: Pseudo-code for sequential MUS construction with conflict-set refinement and resource limits. . . . Figure 3: Pseudo-code for Logic-based Benders decomposition with a complete subproblem. |
| Open Source Code | No | The paper does not provide concrete access to source code (e.g., a specific repository link or an explicit statement of code release) for the methodology described. |
| Open Datasets | No | The paper describes problem classes used for evaluation (e.g., Planning and Scheduling, Alternative Resource Scheduling), but does not provide concrete access information (link, DOI, citation) for specific datasets within those classes. It mentions |
| Dataset Splits | No | The paper does not provide specific dataset split information (e.g., percentages, sample counts, or citations to predefined splits) needed to reproduce the data partitioning. It mentions different problem classes, but not how data was split within them. |
| Hardware Specification | No | No specific hardware details (e.g., GPU/CPU models, memory amounts) used for running experiments are provided in the paper. It only mentions general solver usage. |
| Software Dependencies | Yes | We tested Chuffed (CP) (Chu 2011), Gurobi 6.5 (MIP) (Gurobi 2016) |
| Experiment Setup | Yes | For LBBD, cut minimization was run with a budget of 512 conflicts, after which the current cut was returned. |