Short pages
From COST Action FP0804: FORSYS
Showing below up to 50 results starting with #401.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)
- (hist) ALNS - adaptive large neighborhood search [35 bytes]
- (hist) Heuristics [35 bytes]
- (hist) Hooke and Jeeves [35 bytes]
- (hist) Multi-objective programming [35 bytes]
- (hist) User and stakeholder expectation [35 bytes]
- (hist) Dynamic programming [35 bytes]
- (hist) Convex programming [35 bytes]
- (hist) Branch and Bound algorithm [35 bytes]
- (hist) User and stakeholder motivation [35 bytes]
- (hist) Optimisation methods [35 bytes]
- (hist) Hero [35 bytes]
- (hist) Mathematical programming [35 bytes]
- (hist) Simulation [35 bytes]
- (hist) Providing structure to the decision making process [35 bytes]
- (hist) Linear programming [35 bytes]
- (hist) Simulated annealing [35 bytes]
- (hist) Artificial neural networks [35 bytes]
- (hist) MAV - approach [35 bytes]
- (hist) User and stakeholder identification [35 bytes]
- (hist) Transparency [35 bytes]
- (hist) Particle swarm optimisation [35 bytes]
- (hist) Trajectory optimisation [35 bytes]
- (hist) Integer programming [35 bytes]
- (hist) Independence and neutrality of the process [35 bytes]
- (hist) Disjunctive programming [35 bytes]
- (hist) PBS - preference based search [35 bytes]
- (hist) Pareto optimisation [35 bytes]
- (hist) Stochastic programming [35 bytes]
- (hist) Robust programming [35 bytes]
- (hist) Genetic algorithms [35 bytes]
- (hist) Nelder and Hoad [35 bytes]
- (hist) Differential evolution [35 bytes]
- (hist) Quadratic programming [35 bytes]
- (hist) Lagrangean relaxation [35 bytes]
- (hist) Tabu search [35 bytes]
- (hist) Search of common values [35 bytes]
- (hist) Evolution strategy [35 bytes]
- (hist) Metaheuristic algorithm [35 bytes]
- (hist) Positive mathematical programming [35 bytes]
- (hist) Fostering creative thinking [35 bytes]
- (hist) Goal programming [35 bytes]
- (hist) Nonlinear programming [35 bytes]
- (hist) Opportunity to influence outcome [35 bytes]
- (hist) Fuzzy linear programming [35 bytes]
- (hist) Quality and selection of information [35 bytes]
- (hist) Random ascent [35 bytes]
- (hist) Graph theory [35 bytes]
- (hist) Mixed integer programming [35 bytes]
- (hist) Any optimisation method [35 bytes]
- (hist) User and stakeholder involvement [35 bytes]