A multidimensional maximum bisection problem
Discrete Mathematics
2015-06-26 v1
Abstract
This work introduces a multidimensional generalization of the maximum bisection problem. A mixed integer linear programming formulation is proposed with the proof of its correctness. The numerical tests, made on the randomly generated graphs, indicates that the multidimensional generalization is more difficult to solve than the original problem.
Cite
@article{arxiv.1506.07731,
title = {A multidimensional maximum bisection problem},
author = {Zoran Maksimovic},
journal= {arXiv preprint arXiv:1506.07731},
year = {2015}
}