Pages that link to "Item:Q4319534"
From MaRDI portal
The following pages link to A Rigorous Computational Comparison of Alternative Solution Methods for the Generalized Assignment Problem (Q4319534):
Displayed 24 items.
- A variable depth search branching (Q453047) (← links)
- Testing cut generators for mixed-integer linear programming (Q734353) (← links)
- Lagrangian relaxation guided problem space search heuristics for generalized assignment problems (Q884028) (← links)
- Group-scheduling problems in electronics manufacturing (Q964869) (← links)
- A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem (Q992649) (← links)
- AEGIS---attribute experimentation guiding improvement searches (Q1038838) (← links)
- Performance characteristics of alternative genetic algorithmic approaches to the traveling salesman problem using path representation: An empirical study (Q1296791) (← links)
- Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study (Q1296795) (← links)
- A genetic algorithm for the generalised assignment problem (Q1361390) (← links)
- A simple dual algorithm for the generalised assignment problem (Q1365112) (← links)
- A hybrid heuristic for the generalized assignment problem (Q1390290) (← links)
- Effective algorithm and heuristic for the generalized assignment problem. (Q1417503) (← links)
- Lagrangean/surrogate relaxation for generalized assignment problems (Q1809834) (← links)
- Maximal covering code multiplexing access telecommunication networks (Q1876173) (← links)
- Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches (Q1908034) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Multivariate composite distributions for coefficients in synthetic optimization problems (Q1969891) (← links)
- An ejection chain approach for the generalized assignment problem (Q2573015) (← links)
- A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances (Q2629710) (← links)
- On the variable-depth-search heuristic for the linear-cost generalized assignment problem (Q2752253) (← links)
- Optimal ABC inventory classification using interval programming (Q2792928) (← links)
- Generalized cover facet inequalities for the generalized assignment problem (Q3553764) (← links)
- A tabu search heuristic for the generalized assignment problem (Q5938390) (← links)
- A Survey of the Generalized Assignment Problem and Its Applications (Q6102818) (← links)