Pages that link to "Item:Q5850937"
From MaRDI portal
The following pages link to Modeling the Pre Auction Stage The Truckload Case (Q5850937):
Displaying 19 items.
- A sampling-based stochastic winner determination model for truckload service procurement (Q264290) (← links)
- New results for the directed profitable rural postman problem (Q296876) (← links)
- A branch-and-cut algorithm for the profitable windy rural postman problem (Q321108) (← links)
- An ILP-refined tabu search for the directed profitable rural postman problem (Q406489) (← links)
- An efficient bidding heuristic for simultaneous truckload transportation auctions (Q828668) (← links)
- Modeling and analysis of an auction-based logistics market (Q930968) (← links)
- Multiobjective combinatorial auctions in transportation procurement (Q1719461) (← links)
- Transportation service procurement bid construction problem from less than truckload perspective (Q1720469) (← links)
- The directed profitable rural postman problem with incompatibility constraints (Q1753601) (← links)
- Linearization technique with superior expressions for centralized planning problem with discount policy (Q2137652) (← links)
- The stochastic bid generation problem in combinatorial transportation auctions (Q2514752) (← 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)
- Auction model of shipowners' fraud-resistant for freight spread contracts (Q3386337) (← links)
- Transportation Procurement with Seasonally Varying Shipper Demand and Volume Guarantees (Q3392206) (← links)
- Carrier assignment models in transportation procurement (Q3433503) (← 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)
- A two‐stage method for the shipper lane selection problem with time windows in transportation service procurement (Q6195025) (← links)