Pages that link to "Item:Q1199507"
From MaRDI portal
The following pages link to A survey of algorithms for the generalized assignment problem (Q1199507):
Displaying 30 items.
- Approximating solutions to a bilevel capacitated facility location problem with customer's patronization toward a list of preferences (Q2422923) (← links)
- A Lagrangian relaxation-based heuristic for the vehicle routing with full container load (Q2432884) (← links)
- On a class of assignment problems. (Q2468576) (← links)
- A genetic algorithm for the project assignment problem (Q2485176) (← links)
- A \((1-1/e)\)-approximation algorithm for the generalized assignment problem (Q2494823) (← links)
- Exact solutions to a class of stochastic generalized assignment problems (Q2496071) (← links)
- Supply capacity acquisition and allocation with uncertain customer demands (Q2655615) (← links)
- Optimal ABC inventory classification using interval programming (Q2792928) (← links)
- Optimization-based very large-scale neighborhood search for generalized assignment problems with location/allocation considerations (Q2830959) (← links)
- Exact solution methods for a generalized assignment problem with location/allocation considerations (Q2830960) (← links)
- Two stage decision making approach for Sensor Mission Assignment Problem (Q2954347) (← links)
- Tight Approximation Bounds for the Seminar Assignment Problem (Q2971167) (← links)
- A hybrid algorithm for the generalized assignment problem (Q3348709) (← links)
- A COMPREHENSIVE SURVEY OF THE REVIEWER ASSIGNMENT PROBLEM (Q3585099) (← links)
- Very large-scale variable neighborhood search for the generalized assignment problem (Q3604030) (← links)
- Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem (Q3829355) (← links)
- Algorithms for the Multi-Resource Generalized Assignment Problem (Q3981148) (← links)
- A multiplier adjustment technique for the capacitated concentrator location problem (Q4227929) (← links)
- A Branch-and-Price Algorithm for the Generalized Assignment Problem (Q4384084) (← links)
- Heuristics for the multi-resource generalized assignment problem (Q4544217) (← links)
- A PERCENTILE SEARCH HEURISTIC FOR GENERALIZED ASSIGNMENT PROBLEMS WITH A VERY LARGE NUMBER OF JOBS (Q5315983) (← links)
- Improved Online Algorithms for Knapsack and GAP in the Random Order Model (Q5875474) (← links)
- The stochastic generalised assignment problem with Bernoulli demands (Q5937138) (← links)
- A tabu search heuristic for the generalized assignment problem (Q5938390) (← links)
- A dynamic tabu search for large-scale generalized assignment problems (Q5945334) (← links)
- A three-phase matheuristic algorithm for the multi-day task assignment problem (Q6047850) (← links)
- A Survey of the Generalized Assignment Problem and Its Applications (Q6102818) (← links)
- Sensitivity analysis of combinatorial optimization problems using evolutionary bilevel optimization and data mining (Q6113074) (← links)
- A network flow algorithm for solving generalized assignment problem (Q6483803) (← links)
- Variable neighbourhood search based on Metropolis criterion for crowdsourced delivery scheduling problem in dispatch model (Q6568478) (← links)
