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

Cites work

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