Pages that link to "Item:Q3968760"
From MaRDI portal
The following pages link to An Efficient Primal Simplex Algorithm for Maximum Weighted Vertex Packing on Bipartite Graphs (Q3968760):
Displaying 5 items.
- The Hirsch conjecture for the fractional stable set polytope (Q463733) (← links)
- An extension of the König-Egerváry property to node-weighted bidirected graphs (Q1108202) (← links)
- Strongly polynomial simplex algorithm for bipartite vertex packing (Q1917242) (← links)
- Algorithmic expedients for the prize collecting Steiner tree problem (Q1952504) (← links)
- The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches (Q2427392) (← links)
