Improved linearized models for graph partitioning problem under capacity constraints

DOI10.1080/10556788.2016.1230209zbMath1379.90018OpenAlexW2525650465MaRDI QIDQ4594838

Viet Hung Nguyen, Michel Minoux

Publication date: 24 November 2017

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://hal.sorbonne-universite.fr/hal-01369135/file/Nguyen_2017_Improved_linearized.pdf

zbMATH Keywords

branch-and-boundgraph partitioningcapacity constraintlinearization techniques\(0/1\) quadratically constrained programming

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (1)

An approximation algorithm for graph partitioning via deterministic annealing neural network

This page was built for publication: Improved linearized models for graph partitioning problem under capacity constraints