New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem

DOI10.1016/j.ejor.2012.01.042zbMath1253.90135OpenAlexW2023704570MaRDI QIDQ1926700

Mercedes Landete, Alfredo Marín, Sergio García

Publication date: 29 December 2012

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2012.01.042

zbMATH Keywords

integer programmingdiscrete locationhub location

Mathematics Subject Classification ID

Integer programming (90C10) Discrete location and assignment (90B80)

Related Items (12)

Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing ⋮ Robust optimization approach to capacitated single and multiple allocation hub location problems ⋮ The hub location and pricing problem ⋮ A mixed integer linear model for clustering with variable selection ⋮ Incremental optimization of hub and spoke network for the spokes' numbers and flow ⋮ Hub Location as the Minimization of a Supermodular Set Function ⋮ Hub location problem considering spoke links with incentive-dependent capacities ⋮ A non-triangular hub location problem ⋮ A new formulation and branch-and-cut method for single-allocation hub location problems ⋮ A multiobjective hub-airport location problem for an airline network design ⋮ Perspectives on modeling hub location problems ⋮ A competitive hub location and pricing problem

Cites Work

• Unnamed Item
• Location and allocation for distribution systems with transshipments and transportion economies of scale
• Adapting polyhedral properties from facility to hub location problems
• Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm
• New formulations for the uncapacitated multiple allocation hub location problem
• Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique
• Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
• Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
• Integer programming formulations of discrete hub location problems
• New facets and a branch-and-cut algorithm for the weighted clique problem.
• Preprocessing and cutting for multiple allocation hub location problems.
• Solving large single allocation \(p\)-hub problems with two or three hubs
• Network hub location problems: The state of the art
• Benders Decomposition for Large-Scale Uncapacitated Hub Location
• Hub network design with single and multiple allocation: A computational study
• A dual algorithm for the uncapacitated hub location problem
• An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems

This page was built for publication: New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem