<--- Back to Details
First PageDocument Content
Mathematics / Operations research / Computational complexity theory / Applied mathematics / Mathematical optimization / NP-complete problems / Cybernetics / Heuristics / Hyper-heuristic / Genetic algorithm / Travelling salesman problem / Evolutionary algorithm
Date: 2016-03-15 10:32:14
Mathematics
Operations research
Computational complexity theory
Applied mathematics
Mathematical optimization
NP-complete problems
Cybernetics
Heuristics
Hyper-heuristic
Genetic algorithm
Travelling salesman problem
Evolutionary algorithm

Thursday 31 March EvoCOP 1 - Real World Applications, 11:30-13:10 Chaired by Francisco Chicano Particle Swarm Optimization for Multi-Objective Web Service Location Allocation,

Add to Reading List

Source URL: www.evostar.org

Download Document from Source Website

File Size: 112,37 KB

Share Document on Facebook

Similar Documents

Ng Kong Beng Public Lecture Series 黄光明公开讲座 For the past 40 years computer scientists generally believed that NP-complete problems are intractable. In particular, Boolean satisfiability (SAT), as a paradigma

Ng Kong Beng Public Lecture Series 黄光明公开讲座 For the past 40 years computer scientists generally believed that NP-complete problems are intractable. In particular, Boolean satisfiability (SAT), as a paradigma

DocID: 1udfk - View Document

Djinni 2.1 Approximating NP-Complete Problems, Fast Jeff Ohlmann, Barrett Thomas, Robert Hansen, Tristan Thiede Presented at OSCON 2006

Djinni 2.1 Approximating NP-Complete Problems, Fast Jeff Ohlmann, Barrett Thomas, Robert Hansen, Tristan Thiede Presented at OSCON 2006

DocID: 1tIrp - View Document

Using MVAPICH2-GDR for multi-GPU data parallel graph analytics T. James Lewis SYSTAP™, LLC © All Rights Reserved

Using MVAPICH2-GDR for multi-GPU data parallel graph analytics T. James Lewis SYSTAP™, LLC © All Rights Reserved

DocID: 1rtvU - View Document

On Solving Boolean Multilevel Optimization Problems∗ Josep Argelich INESC-ID Lisbon

On Solving Boolean Multilevel Optimization Problems∗ Josep Argelich INESC-ID Lisbon

DocID: 1rsZm - View Document

Induced paths of given parity in planar graphs  Naomi Nishimura University of Waterloo Canada

Induced paths of given parity in planar graphs Naomi Nishimura University of Waterloo Canada

DocID: 1rsEH - View Document