Valuated matroid-based algorithm for submodular welfare problem
From MaRDI portal
Publication:492835
DOI10.1007/s10479-015-1835-3zbMath1352.90086OpenAlexW1986174745MaRDI QIDQ492835
Kazuo Murota, Takanori Maehara
Publication date: 21 August 2015
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-015-1835-3
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Uses Software
Cites Work
- A survey of very large-scale neighborhood search techniques
- Valuated matroids: A new look at the greedy algorithm
- Valuated matroids
- Discrete convex analysis
- Buying several indivisible goods
- Walrasian equilibrium with gross substitutes
- A genetic algorithm for the generalised assignment problem
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- Matroid rank functions and discrete concavity
- Multiagent resource allocation in \(k\)-additive domains: preference representation and complexity
- Combinatorial auctions with decreasing marginal utilities
- Submodular functions and optimization.
- OPTIMAL ALLOCATION PROBLEM WITH QUADRATIC UTILITY FUNCTIONS AND ITS RELATIONSHIP WITH GRAPH CUT PROBLEM
- Recent Developments in Discrete Convex Analysis
- Improved Approximation Algorithms for Budgeted Allocations
- Budgeted Allocations in the Full-Information Setting
- Tight approximation algorithms for maximum general assignment problems
- Job Matching, Coalition Formation, and Gross Substitutes
- Discrete Convex Analysis
- Valuated Matroid Intersection I: Optimality Criteria
- Valuated Matroid Intersection II: Algorithms
- Algorithm Theory - SWAT 2004
- Energy Efficient Monitoring in Sensor Networks
- A Note on Kelso and Crawford's Gross Substitutes Condition
- Matrices and matroids for systems analysis
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
