Results 291 to 300 of about 148,724 (314)

An Overview and Experimental Study of Learning-Based Optimization Algorithms for the Vehicle Routing Problem

IEEE/CAA Journal of Automatica Sinica, 2022
Guohua Wu, Yongming He, Mingfeng Fan
exaly  

Automatic design of specialized algorithms for the binary knapsack problem

Expert Systems With Applications, 2020
CARLOS Rey, CARLOS Contreras-Bolton, VÍCTOR Parada   +2 more
exaly  

A survey of genetic algorithms for solving multi depot vehicle routing problem

Applied Soft Computing Journal, 2015
Sašo Karakatič, Vili Podgorelec
exaly  

Genetic algorithms for the traveling salesman problem

Annals of Operations Research, 1996
Jean-Yves Potvin, Potvin Jean-Yves
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

Approximate minimization algorithms for the 0/1 Knapsack and Subset-Sum Problem

Operations Research Letters, 2000
Dieter Jungnickel
exaly  

Algorithms for the Split Variational Inequality Problem

Numerical Algorithms, 2011
Yair Censor, Aviv Gibali, Simeon Reich   +2 more
exaly  

A Methodology Based on Evolutionary Algorithms to Solve a Dynamic Pickup and Delivery Problem Under a Hybrid Predictive Control Approach

Transportation Science, 2015
Diego Muñoz-Carpintero, Doris Sáez, Cristian E Cortes   +2 more
exaly  

Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem

Algorithmica, 2012
Frank Neumann, Kratsch Stefan
exaly  

Genetic algorithms for the bus driver scheduling problem: a case study

Journal of the Operational Research Society, 2002
TERESA Galvao Dias
exaly