Branch-and-cut algorithms for the split delivery vehicle routing problem (Q296858): Difference between revisions

From MaRDI portal
Changed an Item
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2014.04.026 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: MAXFLOW / 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.ejor.2014.04.026 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2057532434 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search with vocabulary building approach for the vehicle routing problem with Split demands / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive memory algorithm for the split delivery vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A ring-based diversification scheme for routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A column generation approach for the split delivery vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle routing problems with split deliveries / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lower Bound for the Split Delivery Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized granular tabu search heuristic for the split delivery vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4787357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Savings by Split Delivery Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Split delivery routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved lower bounds for the split delivery vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the capacitated vehicle routing problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2014.04.026 / rank
 
Normal rank

Latest revision as of 13:44, 9 December 2024

scientific article
Language Label Description Also known as
English
Branch-and-cut algorithms for the split delivery vehicle routing problem
scientific article

    Statements

    Branch-and-cut algorithms for the split delivery vehicle routing problem (English)
    0 references
    0 references
    0 references
    23 June 2016
    0 references
    split delivery vehicle routing problem
    0 references
    branch-and-cut
    0 references
    0 references
    0 references

    Identifiers