A primal-dual algorithm for the maximum charge problem with capacity constraints

In this thesis, we study a variant of the maximum cardinality matching problem known as the maximum charge problem. Given a graph with arbitrary positive integer capacities assigned on every vertex and every edge, the goal is to maximize the assignment of positive feasible charges on the edges obeying the capacity constraints, so as to maximize the total sum of the charges. We use the primal-dual approach. We propose a combinatorial algorithm for solving the dual of the restricted primal and show that the primal-dual algorithm runs in a polynomial time.

Authors

• Bhattacharjee, Sangita
• University of Lethbridge. Faculty of Arts and Science

• Matching theory
• Combinatorial optimization
• Graph theory
• Dissertations, Academic

Identifier

hdl:10133/2557

OAI identifier oai:identifier

oai:opus.uleth.ca:10133/2557