Pages that link to "Item:Q1334957"
From MaRDI portal
The following pages link to A separation algorithm for the matchable set polytope (Q1334957):
Displaying 10 items.
- Matchability and \(k\)-maximal matchings (Q617892) (← links)
- A note on the separation problem for the matching matroid (Q760436) (← links)
- Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization (Q847846) (← links)
- On separation and adjacency problems for perfectly matchable subgraph polytopes of a graph (Q911485) (← links)
- The optimal path-matching problem (Q1272178) (← links)
- Primal separation for 0/1 polytopes (Q1396830) (← links)
- The Medusa algorithm for polynomial matings (Q2842880) (← links)
- Perfectly matchable subgraph problem on a bipartite graph (Q5189879) (← links)
- A Separation Algorithm for <i>b</i>-Matching Degree-Sequence Polyhedra (Q5704115) (← links)
- Integer Programming and Combinatorial Optimization (Q5712453) (← links)