Integer programming formulations of discrete hub location problems
From MaRDI portal
Publication:1317166
DOI10.1016/0377-2217(94)90318-2zbMath0790.90048OpenAlexW2037551729MaRDI QIDQ1317166
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
telecommunication systemstransshipment\(p\)-hub medianhubsswitching pointsuncapacitated hub location
Related Items (only showing first 100 items - show all)
New formulations for the uncapacitated multiple allocation hub location problem ⋮ Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing ⋮ Hub location problems with price sensitive demands ⋮ A tabu-search based heuristic for the hub covering problem over incomplete hub networks ⋮ Multiple allocation hub-and-spoke network design under hub congestion ⋮ Hub location for time definite transportation ⋮ Tight bounds from a path based formulation for the tree of hub location problem ⋮ Aggregation in hub location problems ⋮ A 2-phase algorithm for solving the single allocation \(p\)-hub center problem ⋮ New simple and efficient heuristics for the uncapacitated single allocation hub location problem ⋮ The stochastic \(p\)-hub center problem with service-level constraints ⋮ Robust optimization approach to capacitated single and multiple allocation hub location problems ⋮ Upgrading nodes in tree-shaped hub location ⋮ The planar multifacility collection depots location problem ⋮ Optimizing fuzzy \( p\)-hub center problem with generalized value-at-risk criterion ⋮ Multi-product capacitated single-allocation hub location problems: formulations and inequalities ⋮ Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion ⋮ Dantzig-Wolfe decomposition approach to the vehicle assignment problem with demand uncertainty in a hybrid hub-and-spoke network ⋮ Optimal wholesale facilities location within the fruit and vegetables supply chain with bimodal transportation options: an LP-MIP heuristic approach ⋮ The \(q\)-ad hoc hub location problem for multi-modal networks ⋮ Hub location under competition ⋮ Lower bounding procedures for the single allocation hub location problem ⋮ The \(p\)-hub center allocation problem ⋮ GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem ⋮ A branch-and-cut algorithm for the hub location and routing problem ⋮ A capacitated hub location problem under hose demand uncertainty ⋮ Branch-and-price approaches for the network design problem with relays ⋮ Routing and scheduling decisions in the hierarchical hub location problem ⋮ Benders decomposition applied to a robust multiple allocation incomplete hub location problem ⋮ Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems ⋮ Reliable single allocation hub location problem under hub breakdowns ⋮ An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty ⋮ The impact of hub failure in hub-and-spoke networks: mathematical formulations and solution techniques ⋮ Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique ⋮ On the enrouting protocol problem under uncertainty ⋮ Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem ⋮ A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem ⋮ Approximability and inapproximability of the star \(p\)-hub center problem with parameterized triangle inequality ⋮ A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem ⋮ A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem ⋮ 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 ⋮ Allocation strategies in hub networks ⋮ An improved algorithm for fixed-hub single allocation problems ⋮ Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems ⋮ Location models for airline hubs behaving as \(M/D/c\) queues. ⋮ Robust solution for a minimax regret hub location problem in a fuzzy-stochastic environment ⋮ Optimization of hybrid hub-and-spoke network operation for less-than-truckload freight transportation considering incremental quantity discount ⋮ Preprocessing and cutting for multiple allocation hub location problems. ⋮ Trade-offs between the stepwise cost function and its linear approximation for the modular hub location problem ⋮ The 2-allocation \(p\)-hub median problem and a modified Benders decomposition method for solving hub location problems ⋮ HUBBI: iterative network design for incomplete hub location problems ⋮ An intermodal hub location problem for container distribution in Indonesia ⋮ Managing facility disruption in hub-and-spoke networks: formulations and efficient solution methods ⋮ Heuristic algorithms for the single allocation \(p\)-hub center problem with routing considerations ⋮ Route planning for a mixed delivery system in long distance transportation and comparison with pure delivery systems ⋮ A multiobjective hub-airport location problem for an airline network design ⋮ Benders decomposition for the uncapacitated multiple allocation hub location problem ⋮ Branch-and-price-and-cut for a service network design and hub location problem ⋮ Developing equilibrium optimization methods for hub location problems ⋮ Exact solution of hub network design problems with profits ⋮ An implicit enumeration algorithm for the hub interdiction median problem with fortification ⋮ Multiple allocation hub interdiction and protection problems: model formulations and solution approaches ⋮ Location and allocation for distribution systems with transshipments and transportion economies of scale ⋮ General variable neighborhood search for the uncapacitated single allocation \(p\)-hub center problem ⋮ An improved linearization technique for a class of quadratic 0-1 programming problems ⋮ Hub location-allocation in intermodal logistic networks ⋮ A fuzzy programming approach for dynamic virtual hub location problem ⋮ Efficient metaheuristics to solve the intermodal terminal location problem ⋮ Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths ⋮ LTL logistics networks with differentiated services ⋮ Hub-and-spoke network design with congestion ⋮ Path relinking approach for multiple allocation hub maximal covering problem ⋮ Routing traffic at hub facilities ⋮ Adapting polyhedral properties from facility to hub location problems ⋮ Solving the uncapacitated hub location problem using genetic algorithms ⋮ Facility location models for distribution system design ⋮ The capacitated single-allocation hub location problem revisited: a note on a classical formulation ⋮ Hub interdiction problem variants: models and metaheuristic solution algorithms ⋮ Flow shipment scheduling in an incomplete hub location-routing network design problem ⋮ A new formulation and an exact approach for the many-to-many hub location-routing problem ⋮ Stochastic air freight hub location and flight routes planning ⋮ Exact computational approaches to a stochastic uncapacitated single allocation \(p\)-hub center problem ⋮ Uncapacitated single and multiple allocation \(p\)-hub center problems ⋮ Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems ⋮ Lagrangean relaxation for the capacitated hub location problem with single assignment ⋮ A linear program for the two-hub location problem ⋮ Tight linear programming relaxations of uncapacitated \(p\)-hub median problems ⋮ The tree of hubs location problem ⋮ Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem ⋮ Designing a hub location and pricing network in a competitive environment ⋮ The capacitated multiple allocation hub location problem: Formulations and algorithms ⋮ On the single-assignment \(p\)-hub center problem ⋮ Efficient solution procedure and reduced size formulations for \(p\)-hub location problems ⋮ Location of hubs in a competitive environment ⋮ A hybrid genetic/optimization algorithm for a task allocation problem ⋮ Solving large single allocation \(p\)-hub problems with two or three hubs ⋮ Network cost minimization using threshold-based discounting ⋮ Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm ⋮ Airline flight frequency determination in response to competitive interactions using fuzzy logic
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Location and allocation for distribution systems with transshipments and transportion economies of scale
- 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
- On ``A quadratic integer program for the location of interacting hub facilities
- A comparison of two dual-based procedures for solving the p-median problem
- A quadratic integer program for the location of interacting hub facilities
- An algorithm for the quadratic assignment problem using Benders' decomposition
- Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
- State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
- On the Location of Hub Facilities
- An Overview of Representative Problems in Location Research
- Designing satellite communication networks by zero—one quadratic programming
- Location-Allocation Problems
- A Dual-Based Procedure for Uncapacitated Facility Location
- Interacting New Facilities and Location-Allocation Problems
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Large-Scale Network Topological Optimization
- Hub Location and the p-Hub Median Problem
- Networking Policies for Hub-and-Spoke Systems with Application to the Air Transportation System
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
This page was built for publication: Integer programming formulations of discrete hub location problems
