The bidding selection and assignment problem with minimum quantity commitment
From MaRDI portal
Recommendations
- The bottleneck problem with minimum quantity commitments
- The bottleneck problem with minimum quantity commitments
- The generalized assignment problem with minimum quantities
- On a dynamic auction mechanism for a bilateral assignment problem
- An integer programming formulation of the bid evaluation problem for coordinated tasks
- Optimal constrained bidding
- Optimal procurement strategies from multiple suppliers with total minimum commitments and order constraints
- Auction/Belief Propagation Algorithms for Constrained Assignment Problem
Cited in
(4)
This page was built for publication: The bidding selection and assignment problem with minimum quantity commitment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387408)