Metaheuristics for the minimum gap graph partitioning problem
From MaRDI portal
Publication:2668747
DOI10.1016/j.cor.2021.105301OpenAlexW3153318158MaRDI QIDQ2668747
Maurizio Bruglieri, Roberto Cordone
Publication date: 7 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2434/849669
Related Items
Multi-constructor CMSA for the maximum disjoint dominating sets problem ⋮ Balanced graph partitioning based on mixed 0-1 linear programming and iteration vertex relocation algorithm ⋮ Connected graph partitioning with aggregated and non‐aggregated gap objective functions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times
- Preprocessing for a map sectorization problem by means of mathematical programming
- Partitioning a graph into minimum gap components
- Approximating the Maximally Balanced Connected Partition Problem in graphs
- Multilevel refinement for combinatorial optimisation problems
- Scheduling technicians and tasks in a telecommunications company
- Some applications of graph theory to clustering
- Landscapes and their correlation functions
- Most uniform path partitioning and its use in image processing
- Future paths for integer programming and links to artificial intelligence
- Integrated versus hierarchical approach for zone delineation and crop planning under uncertainty
- Partitioning a weighted tree into subtrees with weights in a given range
- Algorithms and complexity of range clustering
- Multiple Comparisons Among Means
- Partitioning a graph into connected components with fixed centers and optimizing cost‐based objective functions or equipartition criteria
- Graph Partitioning and Graph Clustering
- Benchmarking optimization software with performance profiles.
