Resource assignment with preference conditions
From MaRDI portal
Publication:869582
DOI10.1016/j.ejor.2006.04.025zbMath1124.90015OpenAlexW2064042103MaRDI QIDQ869582
Mariagrazia Mecoli, Giovanni Felici
Publication date: 8 March 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.04.025
Integer programming (90C10) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Related Items (2)
Win-win match using a genetic algorithm ⋮ Loading tow trains ergonomically for just-in-time part supply
Cites Work
- Unnamed Item
- Unnamed Item
- A facet generation and relaxation technique applied to an assignment problem with side constraints
- Resource constrained assignment problems
- The quadratic assignment problem. Theory and algorithms
- Facets of an assignment problem with 0-1 constraint
- A binary-rounding heuristic for multi-period variable-task-duration assignment problems
- Assignment Problems and the Location of Economic Activities
- Some Facets for an Assignment Problem with Side Constraints
- A Tabu Search Algorithm for the Resource-Constrained Assignment Problem
This page was built for publication: Resource assignment with preference conditions