Dobrovoczki, Péter and Kis, Tamás (2024) Facet separation for disjunctive constraints with network flow representation. ANNALS OF OPERATIONS RESEARCH, 341. pp. 825-857. ISSN 0254-5330 10.1007/s10479-024-06264-2

Text Dobrovoczki_825_35336532_ny.pdf Download (934kB)

Abstract

We present a novel algorithm for separating facet-inducing inequalities for the convex-hull of the union of polytopes representing a disjunctive constraint of special structure. It is required that the union of polytopes admit a certain network flow representation. The algorithm is based on a new, graph theoretic characterization of the facets of the convex-hull. Moreover, we characterize the family of polytopes that are representable by the networks under consideration. We demonstrate the effectiveness of our approach by computational results on a set of benchmark problems.

Item Type:	Article
Subjects:	Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Divisions:	Research Laboratory on Engineering & Management Intelligence
SWORD Depositor:	MTMT Injector
Depositing User:	MTMT Injector
Date Deposited:	17 Oct 2024 08:15
Last Modified:	17 Oct 2024 08:15
URI:	https://eprints.sztaki.hu/id/eprint/10797

Update Item