Elitist genetic algorithm for assignment problem with imprecise goal
From MaRDI portal
Recommendations
- Elitist genetic algorithm approach for assignment problem
- A genetic algorithm for the generalised assignment problem
- A genetic algorithm for the generalised assignment problem
- Genetic algorithm approach for solving the task assignment problem
- Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times
Cites work
- A branch and bound algorithm for the generalized assignment problem
- A genetic algorithm for the generalised assignment problem
- A genetic algorithm for the generalised assignment problem
- A genetic algorithm for the project assignment problem
- A survey of algorithms for the generalized assignment problem
- An indirect genetic algorithm for a nurse-scheduling problem
- Application of a hybrid genetic algorithm to airline crew scheduling
- Genetic algorithms and fuzzy multiobjective optimization
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- Multiobjective programming in optimization of interval objective functions -- a generalized approach
- Multiobjective programming in optimization of the interval objective function
- On comparing interval numbers
- Relaxation heuristics for a generalized assignment problem
Cited in
(12)- Uncertain programming model for uncertain optimal assignment problem
- Solving a multi-objective interval crew-scheduling problem via genetic algorithms
- Methods for solving fuzzy assignment problems and fuzzy travelling salesman problems with different membership functions
- A branching algorithm to solve binary problem in uncertain environment: an application in machine allocation problem
- Elitist genetic algorithm approach for assignment problem
- Mehar's methods for fuzzy assignment problems with restrictions
- Parallel Processing and Applied Mathematics
- Multistate components assignment problem with optimal network reliability subject to assignment budget
- Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times
- Using minimal cuts to optimize network reliability for a stochastic computer network subject to assignment budget
- An application of genetic algorithm in a marketing oriented inventory model with interval valued inventory costs and three-component demand rate dependent on displayed stock level
- Optimal resource assignment to maximize multistate network reliability for a computer network
This page was built for publication: Elitist genetic algorithm for assignment problem with imprecise goal
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856264)
