Separation of Partition Inequalities
From MaRDI portal
Publication:2757634
DOI10.1287/moor.25.2.243.12223zbMath0977.90039OpenAlexW2023911069MaRDI QIDQ2757634
Mourad Baïou, Francisco Barahona, Ali Ridha Mahjoub
Publication date: 26 November 2001
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://basepub.dauphine.fr/handle/123456789/5934
Related Items
A faster algorithm for computing the principal sequence of partitions of a graph, Separation of partition inequalities with terminals, Box-total dual integrality and edge-connectivity, Theory of Principal Partitions Revisited, Graphic Submodular Function Minimization: A Graphic Approach and Applications, A fast exact algorithm for the problem of optimum cooperation and the structure of its solutions, On the Steiner 2-edge connected subgraph polytope, Branch-and-cut approaches for chance-constrained formulations of reliable network design problems, A Network Design Problem with Two-Edge Matching Failures, Network reinforcement, Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut, Separation of partition inequalities for the \((1,2)\)-survivable network design problem
