Valuated matroid-based algorithm for submodular welfare problem
type: Item
instance of: scholarly article
title: Valuated matroid-based algorithm for submodular welfare problem
zbMATH Open document ID: 1352.90086
author: Takanori Maehara
author: Kazuo Murota
published in: Annals of Operations Research
publication date: 2015-08-21T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6474572
zbMATH Keywords: submodular welfare problem
zbMATH Keywords: matroid
zbMATH Keywords: heuristic algorithm
zbMATH Keywords: discrete convex analysis
describes a project that uses: OR-Library
describes a project that uses: Biq Mac
describes a project that uses: BiqMac
MaRDI profile type: Publication
full work available at URL: s10479-015-1835-3
OpenAlex ID: W1986174745
cites work: A survey of very large-scale neighborhood search techniques
cites work: Algorithm Theory - SWAT 2004
cites work: Improved Approximation Algorithms for Budgeted Allocations
cites work: A Note on Kelso and Crawford's Gross Substitutes Condition
cites work: Buying several indivisible goods
cites work: Multiagent resource allocation in \(k\)-additive domains: preference representation and complexity
cites work: A genetic algorithm for the generalised assignment problem
cites work: Walrasian equilibrium with gross substitutes
cites work: Energy Efficient Monitoring in Sensor Networks
cites work: Valuated matroids: A new look at the greedy algorithm
cites work: Valuated matroids
cites work: Q4414632
cites work: Q4196269
cites work: Tight approximation algorithms for maximum general assignment problems
cites work: Submodular functions and optimization.
cites work: Q4780786
cites work: Ejection chains, reference structures and alternating path methods for traveling salesman problems
cites work: Job Matching, Coalition Formation, and Gross Substitutes
cites work: Combinatorial auctions with decreasing marginal utilities
cites work: Q4668573
cites work: Q3682236
cites work: Valuated Matroid Intersection I: Optimality Criteria
cites work: Valuated Matroid Intersection II: Algorithms
cites work: Discrete convex analysis
cites work: Matrices and matroids for systems analysis
cites work: Discrete Convex Analysis
cites work: Recent Developments in Discrete Convex Analysis
cites work: Q2999658
cites work: Q3135082
cites work: Matroid rank functions and discrete concavity
cites work: Optimal allocation problem with quadratic utility functions and its relationship with graph cut problem
cites work: Budgeted Allocations in the Full-Information Setting
DOI: 10.1007/S10479-015-1835-3
description: scientific article; zbMATH DE number 6474572