Simultaneous eating algorithm and greedy algorithm in assignment problems
From MaRDI portal
Publication:6176397
DOI10.1007/S10878-023-01063-0zbMATH Open1522.90171OpenAlexW4384565096MaRDI QIDQ6176397FDOQ6176397
Authors: Ping Zhan 
Publication date: 22 August 2023
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-023-01063-0
Recommendations
- Simultaneous approximation by greedy algorithms
- A class of greedy algorithms for the generalized assignment problem
- Some recent results in the analysis of greedy algorithms for assignment problems
- Heuristic and exact algorithms for the simultaneous assignment problem
- Greedy solutions of selection and ordering problems
- Greedy in Approximation Algorithms
- On the Greedy Solution of Ordering Problems
- An algorithm for the assignment problem
- scientific article; zbMATH DE number 1146090
- A comparison of two algorithms for the assignment problem
Individual preferences (91B08) Combinatorial optimization (90C27) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Cites Work
- How to divide when there isn't enough. From Aristotle, the Talmud, and Maimonides to the axiomatics of resource allocation
- Convex Analysis
- Title not available (Why is that?)
- Submodular functions and optimization.
- Title not available (Why is that?)
- A new solution to the random assignment problem.
- Ordinal efficiency and the polyhedral separating hyperplane theorem
- A solution to the random assignment problem on the full preference domain
- A constructive proof of the ordinal efficiency welfare theorem
- Ordinal efficiency and dominated sets of assignments.
- Two axiomatic approaches to the probabilistic serial mechanism
- Efficient rules for probabilistic assignment
- Constrained random matching
- Sufficient conditions for the optimality of the greedy algorithm in greedoids
- Extended random assignment mechanisms on a family of good sets
- Submodular optimization views on the random assignment problem
- The vigilant eating rule: a general approach for probabilistic economic design with constraints
- A simple characterization of assignment mechanisms on set constraints
Cited In (1)
This page was built for publication: Simultaneous eating algorithm and greedy algorithm in assignment problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6176397)
