Hub-and-spoke network design and fleet deployment for string planning of liner shipping
type: Item
instance of: scholarly article
title: Hub-and-spoke network design and fleet deployment for string planning of liner shipping
zbMATH Open document ID: 1351.90046
author: Shahin Gelareh
author: Philippe Mahey
author: Rahimeh Neamatian Monemi
author: Nelson Maculan
published in: Applied Mathematical Modelling
publication date: 2016-12-06T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90B06
zbMATH DE Number: 6661461
zbMATH Keywords: integer programming
zbMATH Keywords: transportation
zbMATH Keywords: liner shipping
zbMATH Keywords: decomposition
zbMATH Keywords: Lagrangian relaxation
zbMATH Keywords: environment and emission
MaRDI profile type: Publication
full work available at URL: j.apm.2012.07.017
OpenAlex ID: W1978264689
cites work: Ship scheduling: The last decade
cites work: A multi-start local search heuristic for ship scheduling -- a computational study
cites work: A tabu search heuristic for ship routing and scheduling with flexible cargo quantities
cites work: Network Design and Allocation Mechanisms for Carrier Alliances in Liner Shipping
cites work: Q3829318
cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems
cites work: Lagrangean relaxation. (With comments and rejoinder).
cites work: Lagrangean Decomposition In Integer Linear Programming: A New Scheme
cites work: Analysis Of Lagrangian Decomposition For The Multi-Item Capacitated Lot-Sizing Problem
cites work: Lagrangean decomposition for integer nonlinear programming with linear constraints
cites work: An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
cites work: On Convergence of an Augmented Lagrangian Decomposition Method for Sparse Convex Optimization
cites work: On augmented Lagrangian decomposition methods for multistage stochastic programs
cites work: Lagrangean decomposition: A model yielding stronger lagrangean bounds
cites work: The traveling-salesman problem and minimum spanning trees: Part II
cites work: Q4132264
cites work: The volume algorithm: Producing primal solutions with a subgradient method
cites work: The volume algorithm revisited: relation with bundle methods
cites work: Ergodic, primal convergence in dual subgradient schemes for convex programming
DOI: 10.1016/J.APM.2012.07.017
description: scientific article; zbMATH DE number 6661461