A Rigorous Computational Comparison of Alternative Solution Methods for the Generalized Assignment Problem
From MaRDI portal
Publication:4319534
DOI10.1287/mnsc.40.7.868zbMath0816.90096OpenAlexW1991827456MaRDI QIDQ4319534
Mohammad M. Amini, Michael J. Racer
Publication date: 11 January 1995
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.40.7.868
statistical experimental designlinear cost generalized assignment problemvariable-depth search heuristic
Combinatorial optimization (90C27) Discrete location and assignment (90B80) Boolean programming (90C09)
Related Items
Maximal covering code multiplexing access telecommunication networks, A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances, A genetic algorithm for the generalised assignment problem, A simple dual algorithm for the generalised assignment problem, Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches, Metaheuristics: A bibliography, Lagrangian relaxation guided problem space search heuristics for generalized assignment problems, A hybrid heuristic for the generalized assignment problem, A Survey of the Generalized Assignment Problem and Its Applications, Effective algorithm and heuristic for the generalized assignment problem., A variable depth search branching, Multivariate composite distributions for coefficients in synthetic optimization problems, Generalized cover facet inequalities for the generalized assignment problem, On the variable-depth-search heuristic for the linear-cost generalized assignment problem, Group-scheduling problems in electronics manufacturing, A tabu search heuristic for the generalized assignment problem, A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem, Optimal ABC inventory classification using interval programming, Testing cut generators for mixed-integer linear programming, Lagrangean/surrogate relaxation for generalized assignment problems, AEGIS---attribute experimentation guiding improvement searches, Performance characteristics of alternative genetic algorithmic approaches to the traveling salesman problem using path representation: An empirical study, Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study, An ejection chain approach for the generalized assignment problem
