Single-allocation ordered median hub location problems

DOI10.1016/J.COR.2010.07.018MaRDI QIDQ709204zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Antonio M. Rodríguez-Chía, Justo Puerto, A. B. M. Ramos

Publication date 15 October 2010

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

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

zbMATH Keywords

hub location problemsordered median function

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Recommendations

• A specialized branch \& bound \& cut for single-allocation ordered median hub location problems
• Solution algorithms for the capacitated single allocation hub location problem
• Hub Location and the p-Hub Median Problem
• Approximation algorithms for median hub location problems
• A single allocation hub location and pricing problem
• Lower bounding procedures for the single allocation hub location problem
• Improved hardness and approximation results for single allocation hub location problems
• Stochastic single-allocation hub location
• Efficient algorithms for the uncapacitated single allocation p-hub median problem

Cites work

• scientific article; zbMATH DE number 1803765 (Why is no real title available?)
• A 2-phase algorithm for solving the single allocation p-hub center problem
• A branch and cut algorithm for hub location problems with single assignment
• A comparison of formulations and solution methods for the minimum-envy location problem
• A flexible approach to location problems
• A flexible model and efficient solution strategies for discrete location problems
• A hub covering model for cargo delivery systems
• A new formulation and resolution method for the \(p\)-center problem
• A quadratic integer program for the location of interacting hub facilities
• A stochastic bi-objective location model for strategic reverse logistics
• A strengthened formulation for the simple plant location problem with order
• Adapting polyhedral properties from facility to hub location problems
• Budget-constrained, capacitated hub location to maximize expected demand coverage in fixed-wireless telecommunication networks
• Distribution systems design with role dependent objectives
• Efficient algorithms for the uncapacitated single allocation p-hub median problem
• Exact procedures for solving the discrete ordered median problem
• Formulating and solving splittable capacitated multiple allocation hub location problems
• Geometrical properties of the symmetrical single facility location problem
• Hub Location and the p-Hub Median Problem
• Lagrangean relaxation for the capacitated hub location problem with single assignment
• Location theory. A unified approach
• Minimizing the sum of the \(k\) largest functions in linear time.
• Model formulations for hub covering problems
• Network hub location problems: The state of the art
• New formulations for the uncapacitated multiple allocation hub location problem
• On the single-assignment \(p\)-hub center problem
• Polyhedral Analysis for the Uncapacitated Hub Location Problem with Modular Arc Capacities
• Preprocessing and cutting for multiple allocation hub location problems.
• Projecting the flow variables for hub location problems
• SOLVING THE UNCAPACITATED MULTIPLE ALLOCATION p-HUB CENTER PROBLEM BY GENETIC ALGORITHM
• Solution algorithms for the capacitated single allocation hub location problem
• Solving a capacitated hub location problem
• Solving covering problems and the uncapacitated plant location problem on trees
• Solving the hub location problem in a star–star network
• Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique
• The \(p\)-hub center allocation problem
• The ordered capacitated facility location problem
• The ordered gradual covering location problem on a network
• The single-assignment hub covering problem: Models and linearizations
• Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm

Cited in

(20)

• The ordered \(k\)-median problem: surrogate models and approximation algorithms
• Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions
• Robust optimization approach to capacitated single and multiple allocation hub location problems
• A distribution map for the one-median location problem on a network
• A fresh view on the discrete ordered median problem based on partial monotonicity
• When centers can fail: a close second opportunity
• Ordered \(p\)-median problems with neighbourhoods
• Hub location under competition
• An exact completely positive programming formulation for the discrete ordered median problem: an extended version
• Proprietor and customer costs in the incomplete hub location-routing network topology
• A new approach to optimize a hub covering location problem with a queue estimation component using genetic programming
• Formulations and valid inequalities for the capacitated dispersion problem
• A comparative study of different formulations for the capacitated discrete ordered median problem
• On hub location problems in geographically flexible networks
• A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
• A specialized branch \& bound \& cut for single-allocation ordered median hub location problems
• A comparative study of formulations and solution methods for the discrete ordered \(p\)-median problem
• Hub Location and the p-Hub Median Problem
• Perspectives on modeling hub location problems
• A modified variable neighborhood search for the discrete ordered median problem

This page was built for publication: Single-allocation ordered median hub location problems

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