Tight bounds from a path based formulation for the tree of hub location problem
From MaRDI portal
(Redirected from Publication:833527)
Recommendations
- Lagrangean relaxation for the capacitated hub location problem with single assignment
- The tree of hubs location problem
- Lower bounding procedures for the single allocation hub location problem
- Branch and price for large-scale capacitated hub location problems with single assignment
- Tight linear programming relaxations of uncapacitated p-hub median problems
Cites work
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 961964 (Why is no real title available?)
- A Benders decomposition for hub location problems arising in public transport
- An extension to rapid transit network design problem
- Approximation algorithms for the optimal \(p\)-source communication spanning tree
- Formulating and solving splittable capacitated multiple allocation hub location problems
- Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
- Hub arc location problems: I. Introduction and results
- Hub location problems in urban traffic networks
- Integer programming formulations of discrete hub location problems
- Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing
- Lagrangean relaxation. (With comments and rejoinder).
- Locating a cycle in a transportation or a telecommunications network
- Locating tree-shaped facilities using the ordered median objective
- Network design for time‐constrained delivery
- On locating path- or tree-shaped facilities on networks
- Optimum Communication Spanning Trees
- Solution algorithms for the capacitated single allocation hub location problem
- The Ring Star Problem: Polyhedral analysis and exact algorithm
- Tight linear programming relaxations of uncapacitated p-hub median problems
Cited in
(36)- Lower Bounds for the Hub Location Problem
- Multiple allocation tree of hubs location problem for non-complete networks
- Multi-product capacitated single-allocation hub location problems: formulations and inequalities
- Integrated multi-level intermodal network design problem: a sustainable approach, based on competition of rail and road transportation systems
- Solving the optimum communication spanning tree problem
- Incremental optimization of hub and spoke network for the spokes' numbers and flow
- Upgrading nodes in tree-shaped hub location
- A biased random-key genetic algorithm for the tree of hubs location problem
- New valid inequalities for the optimal communication spanning tree problem
- Robust optimization approach to capacitated single and multiple allocation hub location problems
- Flow shipment scheduling in an incomplete hub location-routing network design problem
- Approximation algorithm for cycle-star hub network design problems and cycle-metric labeling problems
- MIP models for connected facility location: a theoretical and computational study
- General network design: a unified view of combined location and network design problems
- Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem
- Exact and heuristic algorithms for the design of hub networks with multiple lines
- Looking for edge-equitable spanning trees
- A two-level off-grid electric distribution problem on the continuous space
- An exact algorithm for the modular hub location problem with single assignments
- The capacitated directed cycle hub location and routing problem under congestion
- Multi-objective hub network design under uncertainty considering congestion: an M/M/c/K queue system
- Proprietor and customer costs in the incomplete hub location-routing network topology
- Lagrangean bounds for the optimum communication spanning tree problem
- Hub location problem considering spoke links with incentive-dependent capacities
- Routing and scheduling decisions in the hierarchical hub location problem
- Exact and heuristic approaches for the cycle hub location problem
- On hub location problems in geographically flexible networks
- Tree network design avoiding congestion
- Hub location as the minimization of a supermodular set function
- Decomposition methods based on articulation vertices for degree-dependent spanning tree problems
- A random-key GRASP for combinatorial optimization
- HUBBI: iterative network design for incomplete hub location problems
- The tree-of-hubs location problem with interhub stopovers
- Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems
- Star p-hub center problem and star p-hub median problem with bounded path lengths
- Perspectives on modeling hub location problems
This page was built for publication: Tight bounds from a path based formulation for the tree of hub location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q833527)
