Single-allocation ordered median hub location problems
From MaRDI portal
Publication:709204
DOI10.1016/j.cor.2010.07.018zbMath1231.90271WikidataQ58217199 ScholiaQ58217199MaRDI QIDQ709204
Justo Puerto, Antonio M. Rodríguez-Chía, 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
90B80: Discrete location and assignment
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
- 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
- The ordered gradual covering location problem on a network
- A comparison of formulations and solution methods for the minimum-envy location problem
- 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
- A quadratic integer program for the location of interacting hub facilities
- 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
- Solving covering problems and the uncapacitated plant location problem on trees
- Minimizing the sum of the \(k\) largest functions in linear time.
- A flexible approach to 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
- A strengthened formulation for the simple plant location problem with order
- A New Formulation and Resolution Method for the p-Center 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
