A branch-and-cut algorithm for the hub location and routing problem
From MaRDI portal
(Redirected from Publication:337094)
Recommendations
- A branch and cut algorithm for hub location problems with single assignment
- A branch-and-cut algorithm for the partitioning-hub location-routing problem
- The hub location and routing problem
- New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem
- The tree of hubs location problem
Cites work
- scientific article; zbMATH DE number 1803765 (Why is no real title available?)
- scientific article; zbMATH DE number 3883903 (Why is no real title available?)
- A Branch-and-Cut method for the Capacitated Location-Routing Problem
- A branch and cut algorithm for hub location problems with single assignment
- A branch-and-cut algorithm for the partitioning-hub location-routing problem
- A branch-and-cut algorithm for the plant-cycle location problem
- A compact model and tight bounds for a combined location-routing problem
- A new approach to the maximum-flow problem
- A new formulation and an exact approach for the many-to-many hub location-routing problem
- A quadratic integer program for the location of interacting hub facilities
- A tabu-search based heuristic for the hub covering problem over incomplete hub networks
- A unified exact method for solving different classes of vehicle routing problems
- Allocation strategies in hub networks
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
- An exact algorithm for minimizing routing and operating costs in depot location
- Benders decomposition for large-scale uncapacitated hub location
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- 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
- Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery
- Multistars, partial multistars and the capacitated vehicle routing problem
- Network cost minimization using threshold-based discounting
- Network hub location problems: The state of the art
- Projecting the flow variables for hub location problems
- Restructuring of Swiss parcel delivery services
- Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
- Solving large single allocation \(p\)-hub problems with two or three hubs
- Solving the hub location problem in a star–star network
- Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths
- Star \(p\)-hub median problem with modular arc capacities
- The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic
- The hub location and routing problem
- The many-to-many location-routing problem
- The tree of hubs location problem
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
Cited in
(35)- A branch and cut algorithm for hub location problems with single assignment
- Routing and scheduling decisions in the hierarchical hub location problem
- Heuristic algorithms for the single allocation \(p\)-hub center problem with routing considerations
- A linear program for the two-hub location problem
- A branch-and-cut algorithm for two-level survivable network design problems
- A capacitated hub location problem in freight logistics multimodal networks
- A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem
- Perspectives on modeling hub location problems
- Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem
- Modeling and solving the two-level generalized median tour problem
- A generalized model and a heuristic algorithm for the large-scale covering tour problem
- Location‐routing problem: a classification of recent research
- The ring spur assignment problem: new formulation, valid inequalities and a branch-and-cut approach
- Solving partitioning-hub location-routing problem using DCA
- A new formulation and an exact approach for the many-to-many hub location-routing problem
- Multi-period single-allocation hub location-routing: models and heuristic solutions
- A branch-and-cut algorithm for the partitioning-hub location-routing problem
- Branch-and-price-and-cut for a service network design and hub location problem
- An efficient heuristic for a hub location routing problem
- Exact and heuristic approaches for the cycle hub location problem
- A continuous approximation approach to the planar hub location-routing problem: modeling and solution algorithms
- Ils-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation
- The capacitated directed cycle hub location and routing problem under congestion
- Scalable vertiport hub location selection for air taxi operations in a metropolitan region
- Preprocessing and cutting for multiple allocation hub location problems.
- A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem
- Hierarchical survivable network design problems
- A fuzzy correlation based heuristic for dual-mode integrated location routing problem
- Hub location problem considering spoke links with incentive-dependent capacities
- An endosymbiotic evolutionary algorithm for the hub location-routing problem
- HUBBI: iterative network design for incomplete hub location problems
- The hub location and routing problem
- A branch-and-cut algorithm for the plant-cycle location problem
- A survey of variants and extensions of the location-routing problem
- Planning and design of intermodal hub networks: a literature review
This page was built for publication: A branch-and-cut algorithm for the hub location and routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337094)
