An exact method for the combinatorial bids generation problem with uncertainty on clearing prices, bids success, and contracts materialization

DOI10.1016/J.COR.2022.105982MaRDI QIDQ2676381zbMATH OpenOpenAlexFDO

Authors Farouk Hammami, Monia Rekik, Leandro C. Coelho

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

zbMATH Keywords

bids generationbids successcombinatorial auctionscontracts materializationstochastic pricestransportation procurement

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• The stochastic bid generation problem in combinatorial transportation auctions
• A sampling-based stochastic winner determination model for truckload service procurement
• Modeling the Pre Auction Stage The Truckload Case
• Robust strategic bidding in auction-based markets
• Transportation service procurement bid construction problem from less than truckload perspective

Cites work

• A branch-and-cut algorithm for the team orienteering problem
• A hybrid adaptive large neighborhood search heuristic for the team orienteering problem
• A new bidding framework for combinatorial e-auctions
• A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction
• Combinatorial auctions
• Combinatorial auctions: a survey
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• Location-based techniques for the synergy approximation in combinatorial transportation auctions
• Modeling and solving a logging camp location problem
• Optimal pricing in iterative flexible combinatorial procurement auctions
• Solving multiple scenarios in a combinatorial auction
• The stochastic bid generation problem in combinatorial transportation auctions

Cited in

(4)

• The impact of partial production capacity sharing via production as a service
• A logistics provider's profit maximization facility location problem with random utility maximizing followers
• A 3-space dynamic programming heuristic for the cubic knapsack problem
• Advanced synergy-driven algorithms for bid generation in transportation auctions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2676381)