A new formulation and branch-and-cut method for single-allocation hub location problems

DOI10.1016/J.COR.2023.106241MaRDI QIDQ6164619zbMATH OpenOpenAlexFDO

Authors Inmaculada Espejo, Alfredo Marín, Juan M. Muñoz-Ocaña, Antonio M. Rodríguez-Chía

Publication date 4 July 2023

Published in Computers \& Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1016/j.cor.2023.106241

zbMATH Keywords

branch-and-cutdiscrete optimizationhub locationsingle allocation

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• A branch and cut algorithm for hub location problems with single assignment
• New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem
• New formulations for the uncapacitated multiple allocation hub location problem
• The capacitated multiple allocation hub location problem: Formulations and algorithms
• Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm

Cites work

• A branch and cut algorithm for hub location problems with single assignment
• A compact linearisation of Euclidean single allocation hub location problems
• A hub covering model for cargo delivery systems
• A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion
• A quadratic integer program for the location of interacting hub facilities
• Adapting polyhedral properties from facility to hub location problems
• Allocation strategies in hub networks
• An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
• Benders decomposition algorithms for two variants of the single allocation hub location problem
• Benders decomposition for large-scale uncapacitated hub location
• Efficient algorithms for the uncapacitated single allocation p-hub median problem
• scientific article; zbMATH DE number 3407452 (Why is no real title available?)
• Hub and spoke network design with single-assignment, capacity decisions and balancing requirements
• Integer programming formulations of discrete hub location problems
• Lower bounding procedures for the single allocation hub location problem
• Network hub location problems: The state of the art
• New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem
• On the single-assignment \(p\)-hub center problem
• Partitioning procedures for solving mixed-variables programming problems
• Perspectives on modeling hub location problems
• Projecting the flow variables for hub location problems
• Solution algorithms for the capacitated single allocation hub location problem
• Solving large single allocation p-hub problems with two or three hubs
• The capacitated multiple allocation hub location problem: Formulations and algorithms
• The capacitated single-allocation hub location problem revisited: a note on a classical formulation
• The tree of hubs location problem
• Tight linear programming relaxations of uncapacitated p-hub median problems
• Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm

Cited in

(7)

• Preprocessing and cutting for multiple allocation hub location problems.
• HubLocator: An exact solution method for the multiple allocation hub location problem
• Optimal locating by integrating volumetric fuzzy sets and geographic coordinate system: an application to healthcare
• Hardness and approximation for the star -hub routing cost problem in _ -metric graphs
• A multi-objective model for publicly funded festival planning
• A literature review on hub location-routing models and their solution techniques
• New formulations for the uncapacitated multiple allocation hub location problem

This page was built for publication: A new formulation and branch-and-cut method for single-allocation hub location problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6164619)