Fast synergy approximation in transportation procurement with combinatorial auctions

DOI10.1051/RO/2023022zbMATH Open1519.90128OpenAlexW4321351656MaRDI QIDQ6041234FDOQ6041234

Adel Elomri, Chefi Triki, M. Emre Keskin

Publication date: 26 May 2023

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2023022

Recommendations

• Location-based techniques for the synergy approximation in combinatorial transportation auctions
• Multiobjective combinatorial auctions in transportation procurement
• The stochastic bid generation problem in combinatorial transportation auctions
• Integrating production scheduling and transportation procurement through combinatorial auctions
• An efficient bidding heuristic for simultaneous truckload transportation auctions
• The auction algorithm for the transportation problem
• A combinatorial auction for transportation matching service: formulation and adaptive large neighborhood search heuristic
• MICAI 2004: Advances in Artificial Intelligence
• Experimental and Efficient Algorithms

zbMATH Keywords

transportation networkscombinatorial auctionssynergy approximation

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Auctions, bargaining, bidding and selling, and other market models (91B26) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)

Cited In (2)

• A combinatorial auction for transportation matching service: formulation and adaptive large neighborhood search heuristic
• The stochastic bid generation problem in combinatorial transportation auctions

This page was built for publication: Fast synergy approximation in transportation procurement with combinatorial auctions

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