Proprietor and customer costs in the incomplete hub location-routing network topology

DOI10.1016/j.apm.2013.07.033zbMath1427.90191OpenAlexW1969752310MaRDI QIDQ1991436

Hossein Karimi, Mostafa Setak

Publication date: 30 October 2018

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2013.07.033

zbMATH Keywords

Lagrangian relaxationhub locationvalid inequalityincomplete network

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Related Items

Planning and design of intermodal hub networks: a literature review, Heuristic algorithms for the single allocation \(p\)-hub center problem with routing considerations, Flow shipment scheduling in an incomplete hub location-routing network design problem, A bi-objective incomplete hub location-routing problem with flow shipment scheduling

Cites Work

• Unnamed Item
• Allocation strategies in hub networks
• The capacitated \(p\)-hub median problem with integral constraints: an application to a Chinese air cargo network
• Hub location-allocation in intermodal logistic networks
• Hub and spoke network design with single-assignment, capacity decisions and balancing requirements
• A branch-and-cut algorithm for the partitioning-hub location-routing problem
• Single-allocation ordered median hub location problems
• A tabu-search based heuristic for the hub covering problem over incomplete hub networks
• Tight bounds from a path based formulation for the tree of hub location problem
• Lagrangean relaxation for the capacitated hub location problem with single assignment
• The tree of hubs location problem
• A quadratic integer program for the location of interacting hub facilities
• Solution algorithms for the capacitated single allocation hub location problem
• Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
• Integer programming formulations of discrete hub location problems
• Hub location at digital equipment corporation: A comprehensive analysis of qualitative and quantitative factors
• Topological design of a two-level network with ring-star configuration
• Formulating and solving splittable capacitated multiple allocation hub location problems
• Logistics network design with supplier consolidation hubs and multiple shipment options
• Network hub location problems: The state of the art
• The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• A hub location problem in designing digital data service networks: Lagrangian relaxation approach
• The single-assignment hub covering problem: Models and linearizations