An Integer Linear Programming Formulation and Genetic Algorithm for the Maximum Set Splitting Problem

Bojana Lazović; Miroslav Marić; Vladimir Filipović; Aleksandar Savić

Displaying similar documents to “An Integer Linear Programming Formulation and Genetic Algorithm for the Maximum Set Splitting Problem”

A new heuristic for the quadratic assignment problem.

Drezner, Zvi (2002)

Journal of Applied Mathematics and Decision Sciences

Similarity:

Genetic algorithm for network cost minimization using threshold based discounting.

Podnar, Hrvoje, Skorin-Kapov, Jadranka (2003)

Journal of Applied Mathematics and Decision Sciences

Similarity:

Linear programs with an additional separable concave constraint.

Kuno, Takahito, Shi, Jianming (2004)

Journal of Applied Mathematics and Decision Sciences

Similarity:

Solving the simple plant location problem by genetic algorithm

Jozef Kratica, Dušan Tošic, Vladimir Filipović, Ivana Ljubić (2001)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

The simple plant location problem (SPLP) is considered and a genetic algorithm is proposed to solve this problem. By using the developed algorithm it is possible to solve SPLP with more than 1000 facility sites and customers. Computational results are presented and compared to dual based algorithms.