Heuristics for the multi-resource generalized assignment problem
From MaRDI portal
Publication:4544217
DOI10.1002/nav.1029zbMath1009.90072OpenAlexW1987341903MaRDI QIDQ4544217
Steven P. Wilcox, Joseph B. Mazzola
Publication date: 12 August 2002
Published in: Naval Research Logistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.1029
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Boolean programming (90C09)
Related Items
A three-phase matheuristic algorithm for the multi-day task assignment problem ⋮ A Survey of the Generalized Assignment Problem and Its Applications ⋮ Fleet management: a vehicle and driver assignment model ⋮ A two-stage model for a day-ahead paratransit planning problem
Cites Work
- Unnamed Item
- Zero-one integer programs with few contraints - lower bounding theory
- Zero-one integer programs with few constraints - Efficient branch and bound algorithms
- An integer programming model for the allocation of databases in a distributed computer system
- A new Lagrangian relaxation approach to the generalized assignment problem
- A survey of algorithms for the generalized assignment problem
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
- A Multiplier Adjustment Method for the Generalized Assignment Problem
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- An Exhaustive Analysis of Multiplicative Congruential Random Number Generators with Modulus $2^{31} - 1$
- Resource-Constrained Assignment Scheduling
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
- Generalized Assignment with Nonlinear Capacity Interaction
- Pivot and Complement–A Heuristic for 0-1 Programming
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Algorithms for the Multi-Resource Generalized Assignment Problem
- A branch and bound algorithm for the generalized assignment problem
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Modeling Facility Location Problems as Generalized Assignment Problems
This page was built for publication: Heuristics for the multi-resource generalized assignment problem
