An Efficient Primal Simplex Algorithm for Maximum Weighted Vertex Packing on Bipartite Graphs
From MaRDI portal
Publication:3968760
DOI10.1016/S0304-0208(08)72449-6zbMath0502.90058MaRDI QIDQ3968760
Nemhauser, George I., Yoshiro Ikura
Publication date: 1982
Published in: North-Holland Mathematics Studies (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) Graph theory (including graph drawing) in computer science (68R10)
Related Items (6)
Simplex pivots on the set packing polytope ⋮ An extension of the König-Egerváry property to node-weighted bidirected graphs ⋮ Strongly polynomial simplex algorithm for bipartite vertex packing ⋮ The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches ⋮ Algorithmic expedients for the prize collecting Steiner tree problem ⋮ The Hirsch conjecture for the fractional stable set polytope
This page was built for publication: An Efficient Primal Simplex Algorithm for Maximum Weighted Vertex Packing on Bipartite Graphs
