Integer optimization models and algorithms for the multi-period non-shareable resource allocation problem

Cites Work

A Linear Programming Approach to the Cutting-Stock Problem
A Linear Programming Approach to the Cutting Stock Problem—Part II
Resource-constrained project scheduling: Notation, classification, models, and methods
Title not available (Why is that?)
A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
On practical resource allocation for production planning and scheduling with period overlapping setups
Project selection, scheduling and resource allocation with time dependent returns
Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm
Reformulation and decomposition of integer programs
Airline Crew Scheduling: A New Formulation and Decomposition Algorithm
Parallel machine scheduling by column generation
Symmetry in integer linear programming
An effective genetic algorithm approach to multiobjective resource allocation problems (MORAPs)
Title not available (Why is that?)
The Temporal Knapsack Problem and Its Solution
Determining the \(K\)-best solutions of knapsack problems
Title not available (Why is that?)
A quasi-PTAS for unsplittable flow on line graphs
New approximation schemes for unsplittable flow on a path
A constant-factor approximation algorithm for unsplittable flow on paths
Caching is hard -- even in the fault model
Solving the temporal knapsack problem via recursive Dantzig-Wolfe reformulation
Resource allocation problem under single resource assignment
Selection and scheduling of pharmaceutical research projects
Scheduling projects with labor constraints
Improved algorithm for resource allocation problems
Resource allocation for covering time varying demands
An iterative dynamic programming approach for the temporal knapsack problem
Primal Heuristics for Branch and Price: The Assets of Diving Methods
A \((5/3+\varepsilon)\)-approximation for unsplittable flow on a path: placing small tasks into boxes
Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities
An updated survey of variants and extensions of the resource-constrained project scheduling problem
Title not available (Why is that?)
To augment or not to augment: solving unsplittable flow on a path by creating slack

This page was built for publication: Integer optimization models and algorithms for the multi-period non-shareable resource allocation problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6572832)