A comparison of formulations and relaxations for cross-dock door assignment problems
type: Item
instance of: scholarly article
title: A comparison of formulations and relaxations for cross-dock door assignment problems
zbMATH Open document ID: 1391.90389
author: Y. Aharonov
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 6901584
zbMATH Keywords: cross-docking
zbMATH Keywords: MIP formulations
zbMATH Keywords: relaxations and bounds
zbMATH Keywords: column generation
describes a project that uses: Knapsack
MaRDI profile type: Publication
full work available at URL: j.cor.2018.01.022
OpenAlex ID: W2789047767
cites work: On the choice of explicit stabilizing terms in column generation
cites work: Synchronization in cross-docking networks: a research classification and framework
cites work: Minimizing makespan in two-stage hybrid cross docking scheduling problem
cites work: Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
cites work: Integrating dock-door assignment and vehicle routing with cross-docking
cites work: A branch-and-cut algorithm for the truck dock assignment problem with operational time constraints
cites work: Q4178782
cites work: The Effects of Trailer Scheduling on the Layout of Freight Terminals
cites work: Lower bounds for the quadratic assignment problem
cites work: Vehicle routing with cross-dock selection
cites work: An integer programming approach to scheduling the transshipment of products at cross-docks in less-than-truckload industries
cites work: New trends in exact algorithms for the \(0-1\) knapsack problem
DOI: 10.1016/J.COR.2018.01.022
description: scientific article; zbMATH DE number 6901584