Heuristics for the multi-resource generalized assignment problem
From MaRDI portal
Publication:4544217
Recommendations
- Algorithms for the Multi-Resource Generalized Assignment Problem
- Heuristic solution methods for the multilevel generalized assignment problem
- A hybrid heuristic for the generalized assignment problem
- Solving the generalized assignment problem: an optimizing and heuristic approach
- scientific article; zbMATH DE number 3993282
- Relaxation heuristics for a generalized assignment problem
- A robust heuristic for the generalized assignment problem
- scientific article; zbMATH DE number 6796293
- Adaptive heuristic for the generalized assignment problem
- A tabu search heuristic for the generalized assignment problem
Cites work
- A branch and bound algorithm for the generalized assignment problem
- A Multiplier Adjustment Method for the Generalized Assignment Problem
- A new Lagrangian relaxation approach to the generalized assignment problem
- A survey of algorithms for the generalized assignment problem
- Algorithms for the Multi-Resource Generalized Assignment Problem
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
- An Exhaustive Analysis of Multiplicative Congruential Random Number Generators with Modulus $2^{31} - 1$
- An integer programming model for the allocation of databases in a distributed computer system
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Generalized Assignment with Nonlinear Capacity Interaction
- scientific article; zbMATH DE number 40470 (Why is no real title available?)
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Modeling Facility Location Problems as Generalized Assignment Problems
- Pivot and Complement–A Heuristic for 0-1 Programming
- Resource-Constrained Assignment Scheduling
- Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Zero-one integer programs with few constraints - Efficient branch and bound algorithms
- Zero-one integer programs with few contraints - lower bounding theory
Cited in
(24)- The generalized assignment problem with flexible jobs
- A two-stage model for a day-ahead paratransit planning problem
- Relaxation heuristics for a generalized assignment problem
- Capacity planning by the dynamic multi-resource generalized assignment problem (DMRGAP)
- A set partitioning heuristic for the generalized assignment problem
- A robust heuristic for the generalized assignment problem
- A hybrid heuristic for the generalized assignment problem
- Heuristic solution methods for the multilevel generalized assignment problem
- Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
- A binary-rounding heuristic for multi-period variable-task-duration assignment problems
- Fleet management: a vehicle and driver assignment model
- REFING: heuristic to solve bi-objective resource allocation problem with bound and varying capacity
- Solving the generalized assignment problem: an optimizing and heuristic approach
- An optimization-based heuristic for the machine reassignment problem
- Algorithms for the Multi-Resource Generalized Assignment Problem
- scientific article; zbMATH DE number 1960697 (Why is no real title available?)
- An asymptotically optimal greedy heuristic for the multiperiod single-sourcing problem: The cyclic case
- Bicriteria multiresource generalized assignment problem
- A limited resource assignment problem with shortage in the fire department
- scientific article; zbMATH DE number 6796293 (Why is no real title available?)
- A three-phase matheuristic algorithm for the multi-day task assignment problem
- Analysis of a local search heuristic for the generalized assignment problem with resource-independent task profits and identical resource capacity
- A Survey of the Generalized Assignment Problem and Its Applications
- (Pareto)-optimization and greedy algorithm-based solutions for review and panel assignments
This page was built for publication: Heuristics for the multi-resource generalized assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544217)
