The following pages link to (Q3929530):
Displayed 41 items.
- The equilibrium generalized assignment problem and genetic algorithm (Q422905) (← links)
- Environment-conscious scheduling of HPC applications on distributed cloud-oriented data centers (Q635362) (← links)
- Constraint logic programming and integer programming approaches and their collaboration in solving an assignment scheduling problem (Q679422) (← links)
- Implementing an insertion heuristic for vehicle routing on parallel hardware (Q690016) (← links)
- Lagrangian relaxation guided problem space search heuristics for generalized assignment problems (Q884028) (← links)
- The generalized assignment problem: Valid inequalities and facets (Q909579) (← links)
- Improved Lagrangean decomposition: An application to the generalized assignment problem (Q922948) (← links)
- Greedy approaches for a class of nonlinear generalized assignment problems (Q968176) (← links)
- The generalized assignment problem with flexible jobs (Q1003754) (← links)
- A computational evaluation of a general branch-and-price framework for capacitated network location problems (Q1026595) (← links)
- Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem (Q1040083) (← links)
- A survey of algorithms for the generalized assignment problem (Q1199507) (← links)
- An algorithm for the bottleneck generalized assignment problem (Q1260736) (← links)
- Efficient cuts in Lagrangean `relax-and-cut' schemes (Q1291724) (← links)
- Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study (Q1296795) (← links)
- A set partitioning heuristic for the generalized assignment problem (Q1319576) (← links)
- A genetic algorithm for the generalised assignment problem (Q1361390) (← links)
- A simple dual algorithm for the generalised assignment problem (Q1365112) (← links)
- The bottleneck generalized assignment problem (Q1388853) (← links)
- A note on exact algorithms for the bottleneck generalized assignment problem (Q1388862) (← links)
- Logic cuts for multilevel generalized assignment problems. (Q1406973) (← links)
- Effective algorithm and heuristic for the generalized assignment problem. (Q1417503) (← links)
- A class of greedy algorithms for the generalized assignment problem (Q1570837) (← links)
- An exact method for the two-echelon, single-source, capacitated facility location problem (Q1572966) (← links)
- A parametric analysis of heuristics for the vehicle routing problem with side-constraints (Q1600842) (← links)
- A two-echelon stochastic facility location model for humanitarian relief logistics (Q1758057) (← links)
- Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches (Q1908034) (← links)
- Multivariate composite distributions for coefficients in synthetic optimization problems (Q1969891) (← links)
- Bees algorithm for generalized assignment problem (Q2266951) (← links)
- A parallel route building algorithm for the vehicle routing and scheduling problem with time windows (Q2367384) (← links)
- A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem (Q2386217) (← links)
- On a class of assignment problems. (Q2468576) (← links)
- Minimization of makespan in generalized assignment problem. (Q2468617) (← links)
- The sector design and assignment problem for snow disposal operations (Q2480992) (← links)
- A survey of models and algorithms for winter road maintenance. II: System design for snow disposal (Q2565779) (← links)
- A path relinking approach with ejection chains for the generalized assignment problem (Q2570155) (← links)
- A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances (Q2629710) (← links)
- A multiplier adjustment technique for the capacitated concentrator location problem (Q4227929) (← links)
- A tabu search heuristic for the generalized assignment problem (Q5938390) (← links)
- A family of inequalities for the generalized assignment polytope (Q5949919) (← links)
- Analysis of a local search heuristic for the generalized assignment problem with resource-independent task profits and identical resource capacity (Q6048199) (← links)