Single liner shipping service design
DOI10.1016/J.COR.2013.11.018zbMATH Open1348.90116OpenAlexW1985518656WikidataQ58826349 ScholiaQ58826349MaRDI QIDQ336948FDOQ336948
Authors: Christian E. M. Plum, David Pisinger, Juan-José Salazar-González, Mikkel Sigurd 
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2013.11.018
Recommendations
shortest pathtraveling salesman problembranch-and-cut-and-pricenetwork designliner shippingGreen logistics
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)
Cites Work
- Shortest Path Problems with Resource Constraints
- The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- The travelling salesman problem with pick-up and delivery
Cited In (10)
- Rethinking cyclic structures in liner shipping networks
- Container shipping service selection and cargo routing with transshipment limits
- Distribution-free vessel deployment for liner shipping
- A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
- A comparison of column-generation approaches to the synchronized pickup and delivery problem
- Sustainable decision model for liner shipping industry
- Optimal operating strategy for a long-haul liner service route
- A branch-and-price approach to the feeder network design problem
- Container liner shipping network design with shipper's dual preference
- Liner shipping network design
Uses Software
This page was built for publication: Single liner shipping service design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336948)
