A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem

DOI10.1016/J.AMC.2014.03.098zbMath1334.90086OpenAlexW2053167564MaRDI QIDQ274945

Dragan Matić

Publication date: 25 April 2016

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2014.03.098

zbMATH Keywords

combinatorial optimizationgraph partitioningmixed integer linear programmingvariable neighborhood searchbalanced graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

An overview of graph covering and partitioning ⋮ Connected graph partitioning with aggregated and non‐aggregated gap objective functions ⋮ Partitioning a graph into balanced connected classes: formulations, separation and experiments

Uses Software

• CPLEX
• Gurobi

Cites Work

• Unnamed Item
• Unnamed Item
• A variable neighborhood search based algorithm for finite-horizon Markov decision processes
• Integer linear programming model for multidimensional two-way number partitioning problem
• Variable neighborhood search for harmonic means clustering
• Approximating the Maximally Balanced Connected Partition Problem in graphs
• Variable neighbourhood search: methods and applications
• A mixed integer linear programming formulation of the maximum betweenness problem
• Variable neighbourhood search: Methods and applications
• Hybridization of very large neighborhood search for ready-mixed concrete delivery problems
• Variable neighborhood search
• Most uniform path partitioning and its use in image processing
• Local search algorithms for the \(k\)-cardinality tree problem.
• A tabu search heuristic and adaptive memory procedure for political districting
• Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size
• Cost-benefit analysis and MILP for optimal reserve capacity determination in power system
• Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs
• Partitioning a Weighted Tree to Subtrees of Almost Uniform Size

This page was built for publication: A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem