Annals of Operations Research

, Volume 229, Issue 1, pp 565–590

Valuated matroid-based algorithm for submodular welfare problem

Article

DOI: 10.1007/s10479-015-1835-3

Cite this article as:
Maehara, T. & Murota, K. Ann Oper Res (2015) 229: 565. doi:10.1007/s10479-015-1835-3
  • 126 Downloads

Abstract

An algorithm for the submodular welfare problem is proposed based on the theory of discrete convex analysis. The proposed algorithm is a heuristic method built upon the valuated matroid partition algorithms, and gives the exact optimal solution for a reasonable subclass of submodular welfare problems. The algorithm has a guaranteed approximation ratio for a special case. Computational results show fairly good performance of the proposed algorithm.

Keywords

Submodular welfare problem Matroid Heuristic algorithm  Discrete convex analysis 

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  1. 1.Department of Mathematics and Systems EngineeringShizuoka UniversityShizuokaJapan
  2. 2.Department of Mathematical InformaticsUniversity of TokyoTokyoJapan

Personalised recommendations