Pages that link to "Item:Q856264"
From MaRDI portal
The following pages link to Elitist genetic algorithm for assignment problem with imprecise goal (Q856264):
Displaying 11 items.
- Multistate components assignment problem with optimal network reliability subject to assignment budget (Q555430) (← links)
- Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times (Q631908) (← links)
- Using minimal cuts to optimize network reliability for a stochastic computer network subject to assignment budget (Q632651) (← links)
- 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 (Q990548) (← links)
- Optimal resource assignment to maximize multistate network reliability for a computer network (Q991386) (← links)
- Uncertain programming model for uncertain optimal assignment problem (Q1788760) (← links)
- Solving a multi-objective interval crew-scheduling problem via genetic algorithms (Q1929495) (← links)
- Methods for solving fuzzy assignment problems and fuzzy travelling salesman problems with different membership functions (Q1933544) (← links)
- A branching algorithm to solve binary problem in uncertain environment: an application in machine allocation problem (Q2329577) (← links)
- Mehar's Methods for Fuzzy Assignment Problems with Restrictions (Q5216834) (← links)
- Parallel Processing and Applied Mathematics (Q5307391) (← links)
