A Lagrangian Relaxation-Based Heuristic to Solve Large Extended Graph Partitioning Problems

DOI10.1007/978-3-319-30139-6_26zbMath1475.90133OpenAlexW2475189474MaRDI QIDQ2803836

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

Publication date: 3 May 2016

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Theory of organizations, manpower planning in operations research (90B70)

Related Items (1)

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

Uses Software

• Knapsack
• MersenneTwister

Cites Work

• Unnamed Item
• 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
• Mersenne twister
• The Complexity of Multiterminal Cuts
• Exact Solution of the Quadratic Knapsack Problem

This page was built for publication: A Lagrangian Relaxation-Based Heuristic to Solve Large Extended Graph Partitioning Problems