Pages that link to "Item:Q852990"

The following pages link to The service allocation problem at the Gioia Tauro maritime terminal (Q852990):

Displaying 18 items.

• POPMUSIC as a matheuristic for the berth allocation problem (Q276540) (← links)
• A new mixed integer programming model for curriculum balancing: application to a Turkish university (Q296758) (← links)
• Tactical berth allocation under uncertainty (Q320125) (← links)
• Planning activities in a network of logistic platforms with shared resources (Q596457) (← links)
• Repulsive assignment problem (Q963661) (← links)
• Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique (Q976396) (← links)
• A column generation heuristic for a dynamic generalized assignment problem (Q1010279) (← links)
• An integrated model for berth and yard planning in container terminals with multi-continuous berth layout (Q1730671) (← links)
• Human resources management at a marine container terminal (Q1877919) (← links)
• Simultaneous berth allocation and yard planning at tactical level (Q1944874) (← links)
• Compact ILP formulations for a class of solutions to berth allocation and quay crane scheduling problems (Q2150520) (← links)
• A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports (Q2256282) (← links)
• Storage yard operations in container terminals: literature overview, trends, and research directions (Q2256283) (← links)
• A cooperative parallel tabu search algorithm for the quadratic assignment problem (Q2378423) (← links)
• Novel formulations and modeling enhancements for the dynamic berth allocation problem (Q2424775) (← links)
• Operations research at container terminals: a literature update (Q2480797) (← links)
• Team-building with answer set programming in the Gioia-Tauro seaport (Q2909524) (← links)
• An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating (Q5139608) (← links)