A comparison of formulations and relaxations for cross-dock door assignment problems
From MaRDI portal
Publication:1652605
DOI10.1016/j.cor.2018.01.022zbMath1391.90389OpenAlexW2789047767MaRDI QIDQ1652605
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2018.01.022
Related Items (5)
Integrating dock-door assignment and vehicle routing with cross-docking ⋮ A multiobjective mathematical model for truck scheduling problem in multidoor cross-docking system ⋮ Lagrangian relaxation algorithm for the truck scheduling problem with products time window constraint in multi-door cross-dock ⋮ A hub-and-spoke architecture for a parcel delivery system using the cross-docking distribution strategy ⋮ Probabilistic tabu search for the cross-docking assignment problem
Uses Software
Cites Work
- Unnamed Item
- Synchronization in cross-docking networks: a research classification and framework
- A branch-and-cut algorithm for the truck dock assignment problem with operational time constraints
- Minimizing makespan in two-stage hybrid cross docking scheduling problem
- On the choice of explicit stabilizing terms in column generation
- Lower bounds for the quadratic assignment problem
- New trends in exact algorithms for the \(0-1\) knapsack problem
- Integrating dock-door assignment and vehicle routing with cross-docking
- Vehicle routing with cross-dock selection
- An integer programming approach to scheduling the transshipment of products at cross-docks in less-than-truckload industries
- The Effects of Trailer Scheduling on the Layout of Freight Terminals
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
This page was built for publication: A comparison of formulations and relaxations for cross-dock door assignment problems
