Results 291 to 300 of about 161,341 (310)
Some of the next articles are maybe not open access.
Genetic algorithms for the traveling salesman problem
Annals of Operations Research, 1996Jean-Yves Potvin
exaly
Approximate minimization algorithms for the 0/1 Knapsack and Subset-Sum Problem
Operations Research Letters, 2000Dieter Jungnickel
exaly
Dense Subgraphs: Algorithms and complexity analysis of some search and covering problems.
Avec l'expansion rapide d'Internet et le développement des réseaux sociaux, des graphes massifs comprenant des milliards de sommets et d'arêtes ont émergé. Les sous-structures denses, également appelées clusters, présentes dans ces graphes sont cruciales pour de nombreuses applications.openaire +1 more source
Algorithms for the Split Variational Inequality Problem
Numerical Algorithms, 2011Aviv Gibali +2 more
exaly
The traveling salesman problem: An overview of exact and approximate algorithms
European Journal of Operational Research, 1992Gilbert Laporte
exaly
Genetic algorithms for the bus driver scheduling problem: a case study
Journal of the Operational Research Society, 2002Teresa Galvao
exaly
The vehicle routing problem: An overview of exact and approximate algorithms
European Journal of Operational Research, 1992Gilbert Laporte
exaly
Quantum algorithms for Simon's problem over nonabelian groups
ACM Transactions on Algorithms, 2009Gorjan Alagić +2 more
exaly
Approximation algorithms for the arc orienteering problem
Information Processing Letters, 2015Grammati Pantziou +2 more
exaly