Capacitated single allocation hub location problem-A bi-criteria approach
From MaRDI portal
Publication:2483516
Recommendations
- A Heuristic for the Capacitated Single Allocation Hub Location Problem
- Bicriteria \(p\)-hub location problems and evolutionary algorithms
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- Formulating and solving splittable capacitated multiple allocation hub location problems
- A decomposition approach for single allocation hub location problems with multiple capacity levels
Cites work
- scientific article; zbMATH DE number 1803765 (Why is no real title available?)
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- scientific article; zbMATH DE number 1091320 (Why is no real title available?)
- scientific article; zbMATH DE number 1738108 (Why is no real title available?)
- A multicriteria approach to the location of public facilities
- A quadratic integer program for the location of interacting hub facilities
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Enumeration and search procedures for a hub location problem with economies of scale
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Heuristics for the p-hub location problem
- Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
- Hub Location and the p-Hub Median Problem
- Hub arc location problems: I. Introduction and results
- Integer programming formulations of discrete hub location problems
- Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
- Location and allocation for distribution systems with transshipments and transportion economies of scale
- Multicriteria hub decision making for rural area telecommunication networks
- On tabu search for the location of interacting hub facilities
- On the Location of Hub Facilities
- Solution algorithms for the capacitated single allocation hub location problem
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- The latest arrival hub location problem
- Tight linear programming relaxations of uncapacitated p-hub median problems
Cited in
(25)- Multi-product capacitated single-allocation hub location problems: formulations and inequalities
- New complexity results for the \(p\)-hub median problem
- Allocating nodes to hubs for minimizing the hubs processing resources: A case study
- Multiple allocation hub-and-spoke network design under hub congestion
- Robust optimization approach to capacitated single and multiple allocation hub location problems
- Integrated hub location and flow processing schedule problem under renewable capacity constraint
- Multiple criteria facility location problems: a survey
- A decomposition approach for single allocation hub location problems with multiple capacity levels
- Solving a hub location-routing problem with a queue system under social responsibility by a fuzzy meta-heuristic algorithm
- The capacitated single-allocation hub location problem revisited: a note on a classical formulation
- Alternate second order conic program reformulations for hub location under stochastic demand and congestion
- Robust solution for a min-max regret hub location problem in a fuzzy-stochastic environment
- Solution algorithms for the capacitated single allocation hub location problem
- Lagrangean relaxation for the capacitated hub location problem with single assignment
- Multi-objective hub network design under uncertainty considering congestion: an M/M/c/K queue system
- A multiobjective hub-airport location problem for an airline network design
- Heuristic algorithms for the bi-objective hierarchical multimodal hub location problem in cargo delivery systems
- Fathoming rules for biobjective mixed integer linear programs: review and extensions
- Design of intermodal logistics networks with hub delays
- A bi-objective incomplete hub location-routing problem with flow shipment scheduling
- Robust solution for a minimax regret hub location problem in a fuzzy-stochastic environment
- Multiple allocation hub location with service level constraints for two shipment classes
- A fuzzy programming approach for dynamic virtual hub location problem
- Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution
- Variations in the flow approach to CFCLP-TC for multiobjective supply chain design
This page was built for publication: Capacitated single allocation hub location problem-A bi-criteria approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2483516)
