Lagrangian relaxation versus genetic algorithm based metaheuristic for a large partitioning problem

DOI10.1016/j.tcs.2017.01.003zbMath1402.90142OpenAlexW2571799677MaRDI QIDQ1705774

Oliver G. Czibula, Yakov Zinder, Han-Yu Gu

Publication date: 16 March 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10453/125007

zbMATH Keywords

integer programmingLagrangian relaxationpartitioning problemgenetic algorithmheuristic

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Uses Software

• Knapsack
• MersenneTwister

Cites Work

• Balanced graph partitioning
• Min-cut clustering
• Lagrangean relaxation. (With comments and rejoinder).
• Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem
• Iterated responsive threshold search for the quadratic multiple knapsack problem
• The partition problem
• A Lagrangian Relaxation-Based Heuristic to Solve Large Extended Graph Partitioning Problems
• Candidate Sets for Alternative Routes in Road Networks
• VLSI Physical Design: From Graph Partitioning to Timing Closure
• Mersenne twister
• Exact Solution of the Quadratic Knapsack Problem

This page was built for publication: Lagrangian relaxation versus genetic algorithm based metaheuristic for a large partitioning problem