Pages that link to "Item:Q1361390"
From MaRDI portal
The following pages link to A genetic algorithm for the generalised assignment problem (Q1361390):
Displaying 50 items.
- Multi-neighborhood local search optimization for machine reassignment problem (Q342289) (← links)
- The equilibrium generalized assignment problem and genetic algorithm (Q422905) (← links)
- Two heuristic solution concepts for the vehicle selection problem in line haul transports (Q439400) (← links)
- Valuated matroid-based algorithm for submodular welfare problem (Q492835) (← links)
- Multistate components assignment problem with optimal network reliability subject to assignment budget (Q555430) (← links)
- Win-win match using a genetic algorithm (Q611494) (← links)
- Using minimal cuts to optimize network reliability for a stochastic computer network subject to assignment budget (Q632651) (← links)
- Reliable intermodal freight network expansion with demand uncertainties and network disruptions (Q681449) (← links)
- Transmission network expansion planning considering phase-shifter transformers (Q693818) (← links)
- Exploring further advantages in an alternative formulation for the set covering problem (Q783157) (← links)
- A genetic algorithm-based heuristic for the dynamic integrated forward/reverse logistics network for 3PLs (Q850283) (← links)
- Elitist genetic algorithm for assignment problem with imprecise goal (Q856264) (← links)
- A heuristic genetic algorithm for product portfolio planning (Q858285) (← links)
- A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil (Q863989) (← links)
- Multiprogramming genetic algorithm for optimization problems with permutation property (Q870194) (← links)
- Spectral projected subgradient with a momentum term for the Lagrangean dual approach (Q878598) (← links)
- Lagrangian relaxation guided problem space search heuristics for generalized assignment problems (Q884028) (← links)
- A computational study of exact knapsack separation for the generalized assignment problem (Q967219) (← links)
- Optimal resource assignment to maximize multistate network reliability for a computer network (Q991386) (← links)
- A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem (Q992649) (← links)
- A two-stage model for a day-ahead paratransit planning problem (Q1014313) (← links)
- Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem (Q1040083) (← links)
- Logic cuts for multilevel generalized assignment problems. (Q1406973) (← links)
- Effective algorithm and heuristic for the generalized assignment problem. (Q1417503) (← links)
- A tabu search approach to the constraint satisfaction problem as a general problem solver (Q1609921) (← links)
- Robust optimization for non-linear impact of data variation (Q1654345) (← links)
- Diversity controlling genetic algorithm for order acceptance and scheduling problem (Q1718199) (← links)
- Improved Lagrangian bounds and heuristics for the generalized assignment problem (Q1745880) (← links)
- Optimizing cane supply decisions within a sugar mill region (Q1806344) (← links)
- Lagrangean/surrogate relaxation for generalized assignment problems (Q1809834) (← links)
- A genetic algorithm for the vehicle routing problem (Q1870833) (← links)
- A population heuristic for constrained two-dimensional non-guillotine cutting (Q1877899) (← links)
- An evolutionary algorithm approach to the share of choices problem in the product line design (Q1885999) (← links)
- Hybrid genetic algorithm for optimization problems with permutation property (Q1886509) (← links)
- Review on nature-inspired algorithms (Q1981936) (← links)
- A new extended formulation of the generalized assignment problem and some associated valid inequalities (Q2009013) (← links)
- Competence-based assignment of tasks to workers in factories with demand-driven manufacturing (Q2045620) (← links)
- Convergence of the surrogate Lagrangian relaxation method (Q2260658) (← links)
- Bees algorithm for generalized assignment problem (Q2266951) (← links)
- Assignment problems with changeover cost (Q2267319) (← links)
- Hybrid biobjective evolutionary algorithms for the design of a hospital waste management network (Q2271121) (← links)
- Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem (Q2336062) (← links)
- A solution procedure for the discrete time, cost and quality tradeoff problem using electromagnetic scatter search (Q2383848) (← links)
- A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem (Q2386217) (← links)
- On a feasible-infeasible two-population (FI-2Pop) genetic algorithm for constrained optimization: Distance tracing and no free lunch (Q2427178) (← links)
- Expert judgments in the cost-effectiveness analysis of resource allocations: a case study in military planning (Q2454360) (← links)
- Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation (Q2479841) (← links)
- A genetic algorithm for the project assignment problem (Q2485176) (← links)
- Multiple task assignments for cooperating uninhabited aerial vehicles using genetic algorithms (Q2499159) (← links)
- Solving a class of stochastic mixed-integer programs with branch and price (Q2502208) (← links)
