Pages that link to "Item:Q2757634"
From MaRDI portal
The following pages link to Separation of partition inequalities (Q2757634):
Displaying 18 items.
- Separation algorithm for tree partitioning inequalities (Q325404) (← links)
- Branch-and-cut approaches for chance-constrained formulations of reliable network design problems (Q744205) (← links)
- A faster algorithm for computing the principal sequence of partitions of a graph (Q848839) (← links)
- A fast exact algorithm for the problem of optimum cooperation and the structure of its solutions (Q975757) (← links)
- Separating from the dominant of the spanning tree polytope (Q1200792) (← links)
- Projection results for the \(k\)-partition problem (Q1751250) (← links)
- Separation of partition inequalities for the \((1,2)\)-survivable network design problem (Q1866009) (← links)
- Separation of partition inequalities with terminals (Q2386198) (← links)
- Facet-defining inequalities for the simple graph partitioning polytope (Q2467133) (← links)
- Network reinforcement (Q2583121) (← links)
- Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut (Q2583145) (← links)
- Box-total dual integrality and edge-connectivity (Q2689821) (← links)
- Inequalities for plane partitions (Q2694458) (← links)
- Theory of Principal Partitions Revisited (Q2971607) (← links)
- Graphic Submodular Function Minimization: A Graphic Approach and Applications (Q2971617) (← links)
- On the Steiner 2-edge connected subgraph polytope (Q3598034) (← links)
- A Network Design Problem with Two-Edge Matching Failures (Q5247694) (← links)
- Design of survivable networks with low connectivity requirements (Q6659118) (← links)
