Resource constrained assignment problems
From MaRDI portal
Recommendations
- Resource-Constrained Assignment Scheduling
- Restricted assignment scheduling with resource constraints
- scientific article; zbMATH DE number 1302182
- Resource-constrained assignment problems with shared resource consumption and flexible demand
- scientific article; zbMATH DE number 30946
- Resource allocation problem under single resource assignment
- scientific article; zbMATH DE number 544186
- Problems with resource allocation constraints and optimization over the efficient set
- scientific article; zbMATH DE number 4197770
- Publication:4732313
Cites work
- scientific article; zbMATH DE number 3943560 (Why is no real title available?)
- A Lagrangean relaxation method for the constrained assignment problem
- A new algorithm for the assignment problem
- Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
- Facets of the knapsack polytope
- Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
- Resource-Constrained Assignment Scheduling
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
Cited in
(9)- scientific article; zbMATH DE number 5035881 (Why is no real title available?)
- Resource-distribution via Boolean constraints
- Exact solution approaches for bilevel assignment problems
- scientific article; zbMATH DE number 1302182 (Why is no real title available?)
- A distributed exact algorithm for the multiple resource constrained sequencing problem
- Algorithms for finding a \(K\)th best valued assignment
- Resource assignment with preference conditions
- A constrained matching problem
- The Value of Resource Flexibility in the Resource-Constrained Job Assignment Problem
This page was built for publication: Resource constrained assignment problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1264090)
