Partition inequalities: separation, extensions, and network design

zbMATH Open1263.90108MaRDI QIDQ3109933FDOQ3109933

Authors: Mourad Baïou, Francisco Barahona, A. R. Mahjoub 

Publication date: 26 January 2012

Recommendations

• Separation of partition inequalities
• Separation of partition inequalities with terminals
• Separation of partition inequalities for the \((1,2)\)-survivable network design problem
• The partition problem
• Facet-defining inequalities for the simple graph partitioning polytope

zbMATH Keywords

cutting planespartition inequality

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cited In (7)

• Network partition via a bound of the spectral radius
• Polyhedral study of the connected subgraph problem
• Separation of partition inequalities with terminals
• Partitioning networks based on generalized concepts of equivalence
• Title not available (Why is that?)
• The optimal partitioning of networks
• Separation of partition inequalities

This page was built for publication: Partition inequalities: separation, extensions, and network design

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3109933)