Integer programming formulations of discrete hub location problems
From MaRDI portal
Publication:1317166
DOI10.1016/0377-2217(94)90318-2zbMATH Open0790.90048OpenAlexW2037551729MaRDI QIDQ1317166FDOQ1317166
Authors: James F. Campbell 
Publication date: 13 March 1994
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)90318-2
Recommendations
- Hub Location and the p-Hub Median Problem
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
- scientific article; zbMATH DE number 1803765
- Uncapacitated single and multiple allocation \(p\)-hub center problems
- New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem
transshipment\(p\)-hub medianhubstelecommunication systemsswitching pointsuncapacitated hub location
Cites Work
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- A quadratic integer program for the location of interacting hub facilities
- Location-Allocation Problems
- Title not available (Why is that?)
- Hub Location and the p-Hub Median Problem
- Location and allocation for distribution systems with transshipments and transportion economies of scale
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
- Networking Policies for Hub-and-Spoke Systems with Application to the Air Transportation System
- A Dual-Based Procedure for Uncapacitated Facility Location
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
- Title not available (Why is that?)
- A comparison of two dual-based procedures for solving the p-median problem
- An Overview of Representative Problems in Location Research
- Interacting New Facilities and Location-Allocation Problems
- Large-Scale Network Topological Optimization
- Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
- A clustering approach to the planar hub location problem
- Heuristics for the p-hub location problem
- An algorithm for the quadratic assignment problem using Benders' decomposition
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Location of Hub Facilities
- On ``A quadratic integer program for the location of interacting hub facilities
- Designing satellite communication networks by zero—one quadratic programming
Cited In (only showing first 100 items - show all)
- Impact analysis of maritime cabotage legislations on liner hub-and-spoke shipping network design
- Model formulations for hub covering problems
- Title not available (Why is that?)
- Hub location problems with price sensitive demands
- Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing
- Star \(p\)-hub median problem with modular arc capacities
- Multi-product capacitated single-allocation hub location problems: formulations and inequalities
- A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations
- Allocation strategies in hub networks
- Hub location-allocation in intermodal logistic networks
- Location and allocation for distribution systems with transshipments and transportion economies of scale
- Adapting polyhedral properties from facility to hub location problems
- Facility location models for distribution system design
- Solving the uncapacitated hub location problem using genetic algorithms
- HubLocator: An exact solution method for the multiple allocation hub location problem
- New formulations for the uncapacitated multiple allocation hub location problem
- Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm
- A tabu-search based heuristic for the hub covering problem over incomplete hub networks
- Hub location for time definite transportation
- Multiple allocation hub-and-spoke network design under hub congestion
- New simple and efficient heuristics for the uncapacitated single allocation hub location problem
- Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique
- Benders decomposition for the uncapacitated multiple allocation hub location problem
- The single allocation problem in the interacting three-hub network
- Routing traffic at hub facilities
- The tree of hubs location problem
- A quadratic integer program for the location of interacting hub facilities
- Title not available (Why is that?)
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Efficient solution procedure and reduced size formulations for \(p\)-hub location problems
- Robust optimization approach to capacitated single and multiple allocation hub location problems
- Preprocessing and cutting for multiple allocation hub location problems.
- A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion
- An \(M/M/c\) queue model for hub covering location problem
- Hub-and-spoke network design with congestion
- The single-assignment hub covering problem: Models and linearizations
- Stochastic air freight hub location and flight routes planning
- Hub location problems: the location of interacting facilities
- General network design: a unified view of combined location and network design problems
- New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem
- The stochastic \(p\)-hub center problem with service-level constraints
- Tight bounds from a path based formulation for the tree of hub location problem
- Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem
- A 2-phase algorithm for solving the single allocation \(p\)-hub center problem
- Optimal wholesale facilities location within the fruit and vegetables supply chain with bimodal transportation options: an LP-MIP heuristic approach
- The capacitated single-allocation hub location problem revisited: a note on a classical formulation
- Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems
- Route planning for a mixed delivery system in long distance transportation and comparison with pure delivery systems
- Hub location under competition
- Lower bounding procedures for the single allocation hub location problem
- A hybrid genetic/optimization algorithm for a task allocation problem
- A branch-and-cut algorithm for the hub location and routing problem
- Lagrangean relaxation for the capacitated hub location problem with single assignment
- A competitive hub location and pricing problem
- Location models for airline hubs behaving as \(M/D/c\) queues.
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- Solving large single allocation \(p\)-hub problems with two or three hubs
- Network hub location problems: The state of the art
- GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem
- An approximation algorithm for the \(p\)-hub median problem
- Efficient metaheuristics to solve the intermodal terminal location problem
- Uncapacitated single and multiple allocation \(p\)-hub center problems
- Lagrangean relaxation-based techniques for solving facility location problems
- Design of intermodal logistics networks with hub delays
- Aggregation in hub location problems
- The uncapacitated r‐allocation p‐hub center problem
- Location of hubs in a competitive environment
- A hub covering model for cargo delivery systems
- Hub location as the minimization of a supermodular set function
- On the single-assignment \(p\)-hub center problem
- Formulating and solving splittable capacitated multiple allocation hub location problems
- Solving a capacitated hub location problem
- Capacitated single allocation hub location problem-A bi-criteria approach
- Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation
- Network cost minimization using threshold-based discounting
- A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem
- HUBBI: iterative network design for incomplete hub location problems
- An implicit enumeration algorithm for the hub interdiction median problem with fortification
- Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths
- A new formulation and an exact approach for the many-to-many hub location-routing problem
- An efficient genetic algorithm for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem
- Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
- Projecting the flow variables for hub location problems
- Perspectives on modeling hub location problems
- Communication network formation with link specificity and value transferability
- The hub location and pricing problem
- Optimization of hybrid hub-and-spoke network operation for less-than-truckload freight transportation considering incremental quantity discount
- A new formulation and branch-and-cut method for single-allocation hub location problems
- General variable neighborhood search for the uncapacitated single allocation \(p\)-hub center problem
- The planar multifacility collection depots location problem
- The \(p\)-hub center allocation problem
- A new distributionally robust \(p\)-hub median problem with uncertain carbon emissions and its tractable approximation method
- A review of transport market modeling using game-theoretic principles
- An improved mixed integer program for single allocation hub location problems with stepwise cost function
- An intermodal hub location problem for container distribution in Indonesia
- The 2-allocation \(p\)-hub median problem and a modified Benders decomposition method for solving hub location problems
- Trade-offs between the stepwise cost function and its linear approximation for the modular hub location problem
- Alternative formulations for the obnoxious \(p\)-median problem
- Hub location with congestion and time-sensitive demand
This page was built for publication: Integer programming formulations of discrete hub location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1317166)
