A MILP model for the connected multidimensional maximum bisection problem
From MaRDI portal
Cites work
- A .699-approximation algorithm for Max-Bisection.
- A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
- A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem
- A modified VNS metaheuristic for max-bisection problems
- A new Lagrangian net algorithm for solving max-bisection problems
- A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
- Approximating the Maximally Balanced Connected Partition Problem in graphs
- Decomposition based hybrid metaheuristics
- Improved approximation algorithms for MAX k-cut and MAX BISECTION
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Memetic search for the max-bisection problem
- Partitioning of VLSI Circuits on Subcircuits with Minimal Number of Connections Using Evolutionary Algorithm
- Solving Graph Bisection Problems with Semidefinite Programming
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Some optimal inapproximability results
- Some simplified NP-complete graph problems
This page was built for publication: A MILP model for the connected multidimensional maximum bisection problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7031281)
