Tight bounds from a path based formulation for the tree of hub location problem
From MaRDI portal
Publication:833527
DOI10.1016/J.COR.2008.12.009zbMATH Open1176.90351OpenAlexW2076515248MaRDI QIDQ833527FDOQ833527
Ivan Contreras, Alfredo Marín, Elena Fernández
Publication date: 14 August 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2008.12.009
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
- Title not available (Why is that?)
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Integer programming formulations of discrete hub location problems
- Title not available (Why is that?)
- The Ring Star Problem: Polyhedral analysis and exact algorithm
- Solution algorithms for the capacitated single allocation hub location problem
- Lagrangean relaxation. (With comments and rejoinder).
- Formulating and solving splittable capacitated multiple allocation hub location problems
- Hub location problems in urban traffic networks
- Hub Arc Location Problems: Part I—Introduction and Results
- Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
- Network design for time‐constrained delivery
- An extension to rapid transit network design problem
- Approximation algorithms for the optimal \(p\)-source communication spanning tree
- Optimum Communication Spanning Trees
- Locating a cycle in a transportation or a telecommunications network
- Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing
- Locating tree-shaped facilities using the ordered median objective
- A Benders Decomposition for Hub Location Problems Arising in Public Transport
- On locating path- or tree-shaped facilities on networks
- Title not available (Why is that?)
Cited In (35)
- Multiple allocation tree of hubs location problem for non-complete networks
- Hub Location as the Minimization of a Supermodular Set Function
- 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
- Robust optimization approach to capacitated single and multiple allocation hub location problems
- Flow shipment scheduling in an incomplete hub location-routing network design problem
- 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
- Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems
- Lagrangean bounds for the optimum communication spanning tree problem
- Hub location problem considering spoke links with incentive-dependent capacities
- On hub location problems in geographically flexible networks
- Routing and scheduling decisions in the hierarchical hub location problem
- Exact and heuristic approaches for the cycle hub location problem
- Tree network design avoiding congestion
- Decomposition methods based on articulation vertices for degree-dependent spanning tree problems
- A random-key GRASP for combinatorial optimization
- Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems
- HUBBI: iterative network design for incomplete hub location problems
- Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths
- New Valid Inequalities for the Optimal Communication Spanning Tree Problem
- Perspectives on modeling hub location problems
- Lower Bounds for the Hub Location Problem
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)
