scientific article; zbMATH DE number 1833405
From MaRDI portal
Publication:4780786
zbMATH Open1010.90099MaRDI QIDQ4780786FDOQ4780786
Authors:
Publication date: 21 November 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2129/21290102
Title of this publication is not available (Why is that?)
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Microeconomic theory (price theory and economic markets) (91B24)
Cited In (18)
- Approximation Schemes for Multi-Budgeted Independence Systems
- Improved Approximation Algorithms for Budgeted Allocations
- Approximation algorithms for the max-buying problem with limited supply
- Approximating the optimal sequence of acquisitions and sales with a capped budget
- Time bounds for iterative auctions: a unified approach by discrete convex analysis
- Auction/Belief Propagation Algorithms for Constrained Assignment Problem
- Energy Prosumers : Profiling the Energy Microgeneration Market In Lower Silesia, Poland
- Distributed submodular maximization
- Title not available (Why is that?)
- Approximation algorithms for a winner determination problem of single-item multi-unit auctions
- On the configuration LP for maximum budgeted allocation
- A speedy auction using approximated bidders' preferences
- Algorithm Theory - SWAT 2004
- Valuated matroid-based algorithm for submodular welfare problem
- Unconditional competitive auctions with copy and budget constraints
- Approximation algorithms for combinatorial auctions with complement-free bidders
- Approximation Algorithms for k-Duplicates Combinatorial Auctions with Subadditive Bidders
- Computing and Combinatorics
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4780786)
