A Lagrangian relaxation-based heuristic to solve large extended graph partitioning problems
DOI10.1007/978-3-319-30139-6_26zbMATH Open1475.90133OpenAlexW2475189474MaRDI QIDQ2803836FDOQ2803836
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
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
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)
Cites Work
- Mersenne twister
- Title not available (Why is that?)
- The Complexity of Multiterminal Cuts
- Lagrangean relaxation. (With comments and rejoinder).
- Iterated responsive threshold search for the quadratic multiple knapsack problem
- Min-cut clustering
- Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem
- The partition problem
- Exact Solution of the Quadratic Knapsack Problem
Cited In (3)
Uses Software
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)
