Pages that link to "Item:Q1199507"

The following pages link to A survey of algorithms for the generalized assignment problem (Q1199507):

Displaying 50 items.

• The generalized assignment problem with minimum quantities (Q257215) (← links)
• Reducing multivalued discrete variables in solving separable task assignment problems (Q290332) (← links)
• Fast machine reassignment (Q338866) (← links)
• Multi-neighborhood local search optimization for machine reassignment problem (Q342289) (← links)
• The equilibrium generalized assignment problem and genetic algorithm (Q422905) (← links)
• On solving the Lagrangian dual of integer programs via an incremental approach (Q849073) (← links)
• Assignment problems: a golden anniversary survey (Q852938) (← links)
• Elitist genetic algorithm for assignment problem with imprecise goal (Q856264) (← links)
• Lagrangian relaxation guided problem space search heuristics for generalized assignment problems (Q884028) (← links)
• Repulsive assignment problem (Q963661) (← links)
• Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique (Q976396) (← links)
• Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem (Q1040083) (← links)
• R \& D planning and the generalized assignment problem (Q1112722) (← links)
• Relaxation heuristics for a generalized assignment problem (Q1278258) (← links)
• Low earth orbit satellite based communication systems -- research opportunities (Q1278815) (← links)
• Distribution requirements and compactness constraints in school timetabling (Q1291590) (← links)
• Constructing a course schedule by solving a series of assignment type problems (Q1296794) (← links)
• Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study (Q1296795) (← links)
• Solving the generalised assignment problem using polyhedral results (Q1296797) (← links)
• An approximation algorithm for the generalized assignment problem (Q1319018) (← links)
• A set partitioning heuristic for the generalized assignment problem (Q1319576) (← links)
• A genetic algorithm for the generalised assignment problem (Q1361390) (← links)
• The bottleneck generalized assignment problem (Q1388853) (← links)
• A note on exact algorithms for the bottleneck generalized assignment problem (Q1388862) (← links)
• A hybrid heuristic for the generalized assignment problem (Q1390290) (← links)
• Effective algorithm and heuristic for the generalized assignment problem. (Q1417503) (← links)
• A class of greedy algorithms for the generalized assignment problem (Q1570837) (← links)
• Development and evaluation of an assignment heuristic for allocating cross-trained workers (Q1600882) (← links)
• A tabu search approach to the constraint satisfaction problem as a general problem solver (Q1609921) (← links)
• Product allocation to different types of distribution center in retail logistics networks (Q1681420) (← links)
• Utilizing individual picker skills to improve order batching in a warehouse (Q1694830) (← links)
• New mathematical models for team formation of sports clubs before the match (Q1725824) (← links)
• An exact algorithm for the minimum squared load assignment problem (Q1734825) (← links)
• The capacitated mobile facility location problem (Q1737488) (← links)
• Overcoming human trafficking via operations research and analytics: opportunities for methods, models, and applications (Q1751884) (← links)
• Optimizing cane supply decisions within a sugar mill region (Q1806344) (← links)
• Exploiting process plan flexibility in production scheduling: A multi-objective approach (Q1809824) (← 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)
• A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm (Q1919838) (← links)
• Stochastic binary problems with simple penalties for capacity constraints violations (Q1949274) (← links)
• A new extended formulation of the generalized assignment problem and some associated valid inequalities (Q2009013) (← links)
• Improved online algorithms for Knapsack and GAP in the random order model (Q2032350) (← links)
• Improving defensive air battle management by solving a stochastic dynamic assignment problem via approximate dynamic programming (Q2103047) (← links)
• Online generalized assignment problem with historical information (Q2108140) (← links)
• Fair task allocation problem (Q2288963) (← links)
• Loading tow trains ergonomically for just-in-time part supply (Q2301970) (← links)
• A branching algorithm to solve binary problem in uncertain environment: an application in machine allocation problem (Q2329577) (← links)
• Competitive strategies for an online generalized assignment problem with a service consecution constraint (Q2355803) (← links)