A multidimensional maximum bisection problem
Zoran Maksimovic
TL;DR
This paper introduces a multidimensional extension of the maximum bisection problem, providing a mathematical formulation and demonstrating its increased computational complexity through numerical experiments.
Contribution
It presents a novel multidimensional generalization of the maximum bisection problem along with a mixed integer linear programming formulation.
Findings
Multidimensional problem is harder to solve than the original.
Proposed formulation is correct and validated.
Numerical tests confirm increased complexity.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Approximation and Integration · graph theory and CDMA systems · Point processes and geometric inequalities