Strong bounds for resource constrained project scheduling: Preprocessing and cutting planes
Abstract Resource Constrained Project Scheduling Problems (RCPSPs) without preemption
are well-known N P-hard combinatorial optimization problems. A feasible RCPSP solution …
are well-known N P-hard combinatorial optimization problems. A feasible RCPSP solution …
Application of the Lov\'asz-Schrijver Lift-and-Project Operator to Compact Stable Set Integer Programs
F Battista, F Rossi, S Smriglio - arXiv preprint arXiv:2407.19290, 2024 - arxiv.org
The Lov\'asz theta function $\theta (G) $ provides a very good upper bound on the stability
number of a graph $ G $. It can be computed in polynomial time by solving a semidefinite …
number of a graph $ G $. It can be computed in polynomial time by solving a semidefinite …
[PDF][PDF] Application of the Lovász-Schrijver Operator to Compact Stable Set Integer Programs
The Lovász theta function θ (G) provides a very good upper bound on the stability number of
a graph G. It can be computed in polynomial time by solving a semidefinite program (SDP) …
a graph G. It can be computed in polynomial time by solving a semidefinite program (SDP) …
Separation Strategies for Chvátal-Gomory Cuts in Resource Constrained Project Scheduling Problems: A Computational Study
JAS Araujo, HG Santos - … Conference on Computational Science and Its …, 2017 - Springer
Abstract The Resource Constrained Project Scheduling Problems is a well-known N P-hard
combinatorial optimization problem. A solution for RCPSP consists in allocating jobs by …
combinatorial optimization problem. A solution for RCPSP consists in allocating jobs by …
[引用][C] Mixed-integer linear programming based approaches for the resource constrained project scheduling problem.
JAS Araujo - 2019