A lower bound for the adaptive two-echelon capacitated vehicle routing problem (Q2012880): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10878-016-0028-6 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-016-0028-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2392146085 / 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: An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: State-space relaxation procedures for the computation of bounds to routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Truck Dispatching Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-objective vehicle routing and scheduling problem with uncertainty in customers' request and priority / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-depot vehicle routing problem with time windows under shared depot resources / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4955264 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approximation Algorithm for the Capacitated Arc Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10878-016-0028-6 / rank
 
Normal rank

Latest revision as of 18:40, 16 December 2024

scientific article
Language Label Description Also known as
English
A lower bound for the adaptive two-echelon capacitated vehicle routing problem
scientific article

    Statements

    A lower bound for the adaptive two-echelon capacitated vehicle routing problem (English)
    0 references
    0 references
    0 references
    0 references
    3 August 2017
    0 references
    modern logistics
    0 references
    adaptive two-echelon capacitated vehicle routing problem
    0 references
    Lagrangian relaxation
    0 references
    0 references
    0 references

    Identifiers