A Lagrangian relaxation-based heuristic to solve large extended graph partitioning problems

DOI10.1007/978-3-319-30139-6_26MaRDI QIDQ2803836zbMATH OpenOpenAlexFDO

Authors Oliver G. Czibula, Yakov Zinder, Hanyu 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

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

Recommendations

• Lagrangian relaxation versus genetic algorithm based metaheuristic for a large partitioning problem
• Scheduling personnel retraining: column generation heuristics
• On some large-scale LP relaxations for the graph partitioning problem and their optimal solutions
• Lagrangian heuristics for instructor scheduling in executive development programmes
• Planning personnel retraining: column generation heuristics

Cites work

• Exact Solution of the Quadratic Knapsack Problem
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Iterated responsive threshold search for the quadratic multiple knapsack problem
• Lagrangean relaxation. (With comments and rejoinder).
• Mersenne twister
• Min-cut clustering
• Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem
• The Complexity of Multiterminal Cuts
• The partition problem

Cited in

(3)

• Lagrangian relaxation versus genetic algorithm based metaheuristic for a large partitioning problem
• Lagrangian relaxation and pegging test for the clique partitioning problem
• Relajacion lagrangeana para el problema de particionamiento de áreas geográficas

Describes a project that uses

Uses Software

• Knapsack
• MersenneTwister

This page was built for publication: A Lagrangian relaxation-based heuristic to solve large extended graph partitioning problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2803836)