Approche polyedrale pour le probleme du separateur (VSP)
Marie-Jean Meurs
TL;DR
This paper introduces a polyhedral approach to the vertex separator problem in graphs, proposing new inequalities and computational tests to improve solution efficiency.
Contribution
It presents a novel polyhedral formulation for VSP with new valid inequalities and computational validation.
Findings
Improved bounds on separator size
Enhanced solution methods demonstrated computationally
New inequalities contribute to better problem-solving efficiency
Abstract
In an undirected connected graph G=(V,E), the vertex separator problem (VSP) asks for a partition of V into nonempty subsets A, B, C such that |C| is minimized such that there is no edge between A and B, and sizes of A and B are similar. This paper presents a polyhedral approach of the (VSP), introducing new efficient valid inequalities and providing computational tests and results.
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
TopicsScheduling and Optimization Algorithms · Advanced Manufacturing and Logistics Optimization · semigroups and automata theory