An exact method for the combinatorial bids generation problem with uncertainty on clearing prices, bids success, and contracts materialization
From MaRDI portal
Publication:2676381
DOI10.1016/j.cor.2022.105982OpenAlexW4288760343MaRDI QIDQ2676381
Monia Rekik, Leandro C. Coelho, Farouk Hammami
Publication date: 27 September 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2022.105982
combinatorial auctionsstochastic pricesbids generationbids successcontracts materializationtransportation procurement
Cites Work
- A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction
- Modeling and solving a logging camp location problem
- Solving multiple scenarios in a combinatorial auction
- Optimal pricing in iterative flexible combinatorial procurement auctions
- A new bidding framework for combinatorial e-auctions
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- Combinatorial auctions
- The stochastic bid generation problem in combinatorial transportation auctions
- Location-based techniques for the synergy approximation in combinatorial transportation auctions
- A hybrid adaptive large neighborhood search heuristic for the team orienteering problem
- Combinatorial Auctions: A Survey
- A branch‐and‐cut algorithm for the Team Orienteering Problem
This page was built for publication: An exact method for the combinatorial bids generation problem with uncertainty on clearing prices, bids success, and contracts materialization