A branch-and-cut algorithm for the hub location and routing problem (Q337094): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A compact model and tight bounds for a combined location-routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network hub location problems: The state of the art / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hub location and routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified exact method for solving different classes of vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut method for the Capacitated Location-Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restructuring of Swiss parcel delivery services / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu-search based heuristic for the hub covering problem over incomplete hub networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new formulation and an exact approach for the many-to-many hub location-routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer programming formulations of discrete hub location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3147668 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hub Arc Location Problems: Part I—Introduction and Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for the partitioning-hub location-routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders Decomposition for Large-Scale Uncapacitated Hub Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: The tree of hubs location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving large single allocation \(p\)-hub problems with two or three hubs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for the uncapacitated single allocation p-hub median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Solution Approach Based on Shortest-Paths for <i>p</i>-Hub Median Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to the maximum-flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for the plant-cycle location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projecting the flow variables for hub location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the hub location problem in a star–star network / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and cut algorithm for hub location problems with single assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for minimizing routing and operating costs in depot location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3217886 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multistars, partial multistars and the capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The many-to-many location-routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2776481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quadratic integer program for the location of interacting hub facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network cost minimization using threshold-based discounting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight linear programming relaxations of uncapacitated \(p\)-hub median problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Allocation strategies in hub networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star \(p\)-hub median problem with modular arc capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic / rank
 
Normal rank

Revision as of 21:47, 12 July 2024

scientific article
Language Label Description Also known as
English
A branch-and-cut algorithm for the hub location and routing problem
scientific article

    Statements

    A branch-and-cut algorithm for the hub location and routing problem (English)
    0 references
    10 November 2016
    0 references
    hub location
    0 references
    routing
    0 references
    valid inequalities
    0 references
    branch-and-cut
    0 references
    0 references
    0 references
    0 references

    Identifiers