A Branch-and-Cut method for the Capacitated Location-Routing Problem (Q622138): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: VRP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CVRPSEP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2010.09.019 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2055539533 / rank
 
Normal rank
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: Heuristic and lower bound for a stochastic location-routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating capacity constraints in the CVRP using tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cycle polytope of a binary matroid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4233333 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for the undirected rural postman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vehicle routing problem. Latest advances and new challenges. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models and exact solutions for a class of stochastic location-routing problems / 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: Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Odd Minimum Cut Sets and <i>b</i>-Matchings Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new branch-and-cut algorithm for the capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combined location-routing problems: A synthesis and future research directions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4532225 / 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: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The effect of ignoring routes when locating depots / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-phase tabu search approach to the location routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic solutions to multi-depot location-routing problems / rank
 
Normal rank

Revision as of 16:49, 3 July 2024

scientific article
Language Label Description Also known as
English
A Branch-and-Cut method for the Capacitated Location-Routing Problem
scientific article

    Statements

    A Branch-and-Cut method for the Capacitated Location-Routing Problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    31 January 2011
    0 references
    Location-Routing Problem
    0 references
    Branch-and-Cut
    0 references
    vehicle routing
    0 references
    facility location
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers