Maximum weight bounded fractional matching
Statement
Given a graph G=(V,E), and weight and capacity functions defined on the edge set, is there a combinatorial, strongly polynomial algorithm to find a vector x maximizing wx subject to the constraints and , where P(G) is the convex hull of the incidence vectors of perfect matchings of G?
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.