An optimization approach for winner determination problem considering transportation cost discounts

DOI10.1007/S10898-021-01035-WzbMath1475.90043OpenAlexW3172180210MaRDI QIDQ2046272

Fang Yang, Yao-Huei Huang

Publication date: 17 August 2021

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-021-01035-w

zbMATH Keywords

discount functionwinner determination problembranch-and-bound treesbig-\(m\) constraintsmixed integer nonconvex programming

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Auctions, bargaining, bidding and selling, and other market models (91B26)

Related Items (1)

Winner determination with sustainable-flexible considerations under demand uncertainty in transportation service procurement auctions

Uses Software

• Gurobi

Cites Work

• Unnamed Item
• The freight allocation problem with lane cost balancing constraint
• An optimization approach for supply chain management models with quantity discount policy
• Joint price and lot size determination under conditions of permissible delay in payments and quantity discounts for freight cost
• An integrated model for lot sizing with supplier selection and quantity discounts
• Linearization technique with superior expressions for centralized planning problem with discount policy
• Alternative solution algorithm for winner determination problem with quantity discount of transportation service procurement
• Incremental and encoding formulations for mixed integer programming
• Combinatorial Auctions: A Survey
• Transportation Procurement with Seasonally Varying Shipper Demand and Volume Guarantees
• Carrier assignment models in transportation procurement
• Single‐period inventory models with demand uncertainty and quantity discounts: Behavioral implications and a new solution procedure
• Base-2 Expansions for Linearizing Products of Functions of Discrete Variables
• Linear Reformulation of Polynomial Discrete Programming for Fast Computation
• Integrating production scheduling and transportation procurement through combinatorial auctions

This page was built for publication: An optimization approach for winner determination problem considering transportation cost discounts