Strong bounds for resource constrained project scheduling: preprocessing and cutting planes
From MaRDI portal
Publication:2333144
DOI10.1016/j.cor.2019.104782zbMath1458.90247arXiv1909.02737OpenAlexW2970385781WikidataQ127315240 ScholiaQ127315240MaRDI QIDQ2333144
Janniele A. S. Araujo, Haroldo Gambini Santos, Bernard Gendron, Danilo S. Souza, Samuel S. Brito, Sanjay Dominik Jena
Publication date: 11 November 2019
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.02737
Related Items (7)
Cover by disjoint cliques cuts for the knapsack problem with conflicting items ⋮ New pseudo polynomial algorithms for a partial resource-constrained project scheduling problem ⋮ A branch-and-bound algorithm for the unit-capacity resource constrained project scheduling problem with transfer times ⋮ Resource-constrained multi-project scheduling problem: a survey ⋮ An updated survey of variants and extensions of the resource-constrained project scheduling problem ⋮ Preprocessing and cutting planes with conflict graphs ⋮ On recognizing staircase compatibility
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Integer programming techniques for the nurse rostering problem
- The multi-mode resource-constrained multi-project scheduling problem, The MISTA 2013 challenge
- An integer programming approach to the multimode resource-constrained multiproject scheduling problem
- A computational study of conflict graphs and aggressive cut separation in integer programming
- Event-based MILP models for resource-constrained project scheduling problems
- Optimizing over the first Chvátal closure
- Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements
- Scheduling subject to resource constraints: Classification and complexity
- PSPLIB -- a project scheduling problem library
- A branch and bound algorithm for the resource-constrained project scheduling problem
- Solving \(0/1\) integer programs with enumeration cutting planes
- Project scheduling. A research handbook.
- On the strength of time-indexed formulations for the resource-constrained project scheduling problem
- Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
- Tight LP bounds for resource constrained project scheduling
- Lifted cover facets of the 0-1 knapsack polytope with GUB constraints
- Conflict graphs in solving integer programming problems
- Sequence independent lifting in mixed integer programming
- An experimental investigation of metaheuristics for the multi-mode resource-constrained project scheduling problem on new dataset instances
- Edmonds polytopes and a hierarchy of combinatorial problems
- An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation
- Strengthening Chvátal-Gomory Cuts for the Stable Set Problem
- Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem
- A Branch-and-Cut Procedure for the Multimode Resource-Constrained Project-Scheduling Problem
- An Automatic Method for Solving Discrete Programming Problems
- Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
- A Computational Study of the Job-Shop Scheduling Problem
- A Horizon-Varying, Zero-One Approach to Project Scheduling
- Facets of the knapsack polytope
- Facets of the Knapsack Polytope From Minimal Covers
- Fenchel Cutting Planes for Integer Programs
- On the facial structure of set packing polyhedra
- Scheduling projects with labor constraints
- An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem
This page was built for publication: Strong bounds for resource constrained project scheduling: preprocessing and cutting planes
