Lagrangian relaxation versus genetic algorithm based metaheuristic for a large partitioning problem
- 1 March 2018
- journal article
- conference paper
- Published by Elsevier in Theoretical Computer Science
- Vol. 718, 24-36
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Coevolutionary Genetic Algorithm Based on the Augmented Lagrangian Function for Solving the Economic Dispatch ProblemIEEE Latin America Transactions, 2015
- Candidate Sets for Alternative Routes in Road NetworksACM Journal of Experimental Algorithmics, 2015
- Iterated responsive threshold search for the quadratic multiple knapsack problemAnnals of Operations Research, 2014
- Tabu-enhanced iterated greedy algorithm: A case study in the quadratic multiple knapsack problemEuropean Journal of Operational Research, 2014
- Balanced Graph PartitioningTheory of Computing Systems, 2006
- Strategic Power Infrastructure DefenseProceedings of the IEEE, 2005
- Lagrangean relaxationTOP, 2003
- A combination of the genetic algorithm and lagrangian relaxation decomposition techniques for the generation unit commitment problemElectric Power Systems Research, 1997
- The partition problemMathematical Programming, 1993
- Min-cut clusteringMathematical Programming, 1993