Pages that link to "Item:Q2514752"

The following pages link to The stochastic bid generation problem in combinatorial transportation auctions (Q2514752):

Displaying 15 items.

• A Lagrangian approach to the winner determination problem in iterative combinatorial reverse auctions (Q319409) (← links)
• Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests (Q322826) (← links)
• Transportation service procurement bid construction problem from less than truckload perspective (Q1720469) (← links)
• Encroachment and canvassing strategy in a sea-cargo service chain with empty container repositioning (Q1728491) (← links)
• Linearization technique with superior expressions for centralized planning problem with discount policy (Q2137652) (← links)
• Online crowdsourced truck delivery using historical information (Q2140193) (← links)
• Non-monetary coordination mechanisms for time slot allocation in warehouse delivery (Q2189884) (← links)
• The cross-entropy method for the winner determination problem in combinatorial auctions (Q2209236) (← links)
• Location-based techniques for the synergy approximation in combinatorial transportation auctions (Q2629915) (← links)
• An exact method for the combinatorial bids generation problem with uncertainty on clearing prices, bids success, and contracts materialization (Q2676381) (← links)
• Request evaluation strategies for carriers in auction-based collaborations (Q5964844) (← links)
• Integrating production scheduling and transportation procurement through combinatorial auctions (Q6092655) (← links)
• Pre-auction lane selection in an integrated production–distribution planning problem (Q6094433) (← links)
• Leader-based diffusion optimization model in transportation service procurement under heterogeneous drivers' collaboration networks (Q6099452) (← links)
• A benders decomposition algorithm for a bid generation problem in the procurement of three-echelon transportation services (Q6106599) (← links)