## On solving the Cross-dock Door Assignment Problem, CDAP

\(\) A class of strong lower bounds on the solution value of a Linearized Integer Programming (LIP) reformulation is introduced for the binary quadratic optimization model to assign origin and destination nodes to strip and stack doors, resp., in a cross-dock infrastructure, whose goal is to minimize the transportation cost of the commodities to be … Read more