Generating experimental data for the generalized assignment problem

Operations Research

Volumn 49, Issue 6, 2001, Pages 866-878

  Romeijn, H Edwin ^a   Morales, Dolores Romero ^a  

^a J Crayton Pruitt Family Department of Biomedical Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COST BENEFIT ANALYSIS; HEURISTIC METHODS; INTEGER PROGRAMMING; JOB ANALYSIS; LINEAR PROGRAMMING; MATHEMATICAL MODELS; RANDOM PROCESSES; SCHEDULING;

DATA GENERATION; GENERALIZED ASSIGNMENT PROBLEM; JOB ASSIGNMENT; STOCHASTIC MODEL;

OPERATIONS RESEARCH;

EID: 0035521438     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.49.6.866.10021     Document Type: Article

References (35)

1. A rigorous computational comparison of alternative solution methods for the generalized assignment problem
2. A hybrid heuristic for the generalized assignment problem
3. An integer generalized transportation model for optimal job assignment in computer networks
4. A property of assignment type mixed integer linear programming problems
5. A survey of algorithms for the generalized assignment problem
6. A set partitioning heuristic for the generalized assignment problem
7. Lagrangean relaxation for a generalized assignment-type problem
8. A genetic algorithm for the generalized assignment problem
9. Using the CPLEX callable library
10. An all zero-one algorithm for a certain class of transportation problems
11. Probabilistic analysis of the generalised assignment problem
12. Greedy randomized adaptive search procedures
13. A generalized assignment heuristic for vehicle routing
14. A multiplier adjustment method for the generalized assignment problem
15. Multicommodity distribution system design by Benders decomposition
16. An improved dual based algorithm for the generalized assignment problem
17. Generating experimental data for computational testing with machine scheduling applications
18. On the maximal covering location problem and the generalized assignment problem
19. Relaxation heuristics for a generalized assignment problem
20. An algorithm for the generalized assignment problem
21. Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
22. Algorithm 769: Fortran subroutines for approximate solution of sparse quadratic assignment problems using GRASP
23. Combinatorial optimization and empirical processes
24. Parallel machine scheduling: A probabilistic analysis
25. A robust heuristic for the generalized assignment problem
26. Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP
27. A class of greedy algorithms for the generalized assignment problem
28. A probabilistic feasibility and value analysis of the generalized assignment problem
29. A branch and bound algorithm for the generalized assignment problem
30. Modeling facility location problems as generalized assignment problems
31. A branch-and-price algorithm for the generalized assignment problem
32. Sharper bounds for Gaussian and empirical processes
33. A linear relaxation heuristic for the generalized assignment problem