A specialized branch \& bound \& cut for single-allocation ordered median hub location problems
From MaRDI portal
Publication:2444555
DOI10.1016/j.dam.2013.05.035zbMath1294.90034OpenAlexW2145482994WikidataQ58217148 ScholiaQ58217148MaRDI QIDQ2444555
A. B. M. Ramos, Justo Puerto, Antonio M. Rodríguez-Chía
Publication date: 10 April 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2013.05.035
Related Items (13)
Robust optimization approach to capacitated single and multiple allocation hub location problems ⋮ Hub location under competition ⋮ A comparative study of formulations and solution methods for the discrete ordered \(p\)-median problem ⋮ Incremental optimization of hub and spoke network for the spokes' numbers and flow ⋮ A comparative study of different formulations for the capacitated discrete ordered median problem ⋮ Segmentation of scanning-transmission electron microscopy images using the ordered median problem ⋮ Two-phase semi-Lagrangian relaxation for solving the uncapacitated distribution centers location problem for B2C E-commerce ⋮ On hub location problems in geographically flexible networks ⋮ Constraint relaxation for the discrete ordered median problem ⋮ Perspectives on modeling hub location problems ⋮ A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem ⋮ The ordered \(k\)-median problem: surrogate models and approximation algorithms ⋮ A branch-and-price approach for the continuous multifacility monotone ordered median problem
Cites Work
- Unnamed Item
- Unnamed Item
- A stochastic bi-objective location model for strategic reverse logistics
- The ordered capacitated facility location problem
- Adapting polyhedral properties from facility to hub location problems
- Single-allocation ordered median 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
- A 2-phase algorithm for solving the single allocation \(p\)-hub center problem
- The \(p\)-hub center allocation problem
- Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique
- Lagrangean relaxation for the capacitated hub location problem with single assignment
- A flexible model and efficient solution strategies for discrete location problems
- Distribution systems design with role dependent objectives
- Solution algorithms for the capacitated single allocation hub location problem
- Preprocessing and cutting for multiple allocation hub location problems.
- On the single-assignment \(p\)-hub center problem
- A branch and cut algorithm for hub location problems with single assignment
- Branching rules revisited
- An extended covering model for flexible discrete and equity location problems
- Solving a capacitated hub location problem
- Formulating and solving splittable capacitated multiple allocation hub location problems
- Network hub location problems: The state of the art
- Exact procedures for solving the discrete ordered median problem
- Budget-Constrained, Capacitated Hub Location to Maximize Expected Demand Coverage in Fixed-Wireless Telecommunication Networks
- Location Theory
- Projecting the flow variables for hub location problems
- A hub covering model for cargo delivery systems
- SOLVING THE UNCAPACITATED MULTIPLE ALLOCATION p-HUB CENTER PROBLEM BY GENETIC ALGORITHM
- Model formulations for hub covering problems
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Hub Location and the p-Hub Median Problem
- The single-assignment hub covering problem: Models and linearizations
- Solving the hub location problem in a star–star network
- Polyhedral Analysis for the Uncapacitated Hub Location Problem with Modular Arc Capacities
This page was built for publication: A specialized branch \& bound \& cut for single-allocation ordered median hub location problems
