Combining linear programming and satisfiability solving for resource planning
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3852784
- Mixed-integer linear programming for resource leveling problems
- Linear programs for constraint satisfaction problems
- Solving planning and scheduling problems with combined integer and constraint programming
- Mixed-integer linear programming and constraint programming formulations for solving resource availability cost problems
- Solving possibilistic linear programming problems
- scientific article; zbMATH DE number 2080319
- Integrating combinatorial algorithms into a linear programming solver
- Solving a possibilistic linear program through compromise programming
- Combination of constraint programming and mathematical programming for solving resources-constrained project-scheduling problems
Cited in
(6)- Improved Computational Approaches and Heuristics for Zero Forcing
- Constraint partitioning in penalty formulations for solving temporal planning problems
- Processes and continuous change in a SAT-based planner
- Constraint solving for proof planning
- Set-structured and cost-sharing heuristics for classical planning
- A Hybrid LP-RPG Heuristic for Modelling Numeric Resource Flows in Planning
This page was built for publication: Combining linear programming and satisfiability solving for resource planning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2775780)
