Branch-and-Cut-and-Price algorithms for the preemptive RCPSP
DOI10.1051/ro/2018031zbMath1398.90108OpenAlexW2802960700MaRDI QIDQ4553884
Hélène Toussaint, Alain Quilliot, Ali Ridha Mahjoub, Pierre Fouilhoux
Publication date: 1 November 2018
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1051/ro/2018031
antichainbranch-and-cut-and-price algorithmpreemptive caseresource-constrained precedence scheduling problem
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Combinatorial optimization (90C27)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An effective branch-and-price algorithm for the preemptive resource constrained project scheduling problem based on minimal interval order enumeration
- An exact approach for the vertex coloring problem
- Linear programming based algorithms for preemptive and non-preemptive RCPSP
- Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements
- Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results
- A linear programming and constraint propagation-based lower bound for the RCPSP
- Resource-constrained project scheduling: Notation, classification, models, and methods
- Tight LP bounds for resource constrained project scheduling
- The project scheduling polyhedron: Dimension, facets and lifting theorems
- An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation
- Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation
- A Horizon-Varying, Zero-One Approach to Project Scheduling
- A Column Generation Approach for Graph Coloring
This page was built for publication: Branch-and-Cut-and-Price algorithms for the preemptive RCPSP
