A matching-based approach for solving a delivery/pick-up vehicle routing problem with time constraints (Q1198141): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching problems with generalized upper bound side constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4026988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal set partitioning, matchings and lagrangian duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5566712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization with nonsmooth data / rank
 
Normal rank

Latest revision as of 14:36, 16 May 2024

scientific article
Language Label Description Also known as
English
A matching-based approach for solving a delivery/pick-up vehicle routing problem with time constraints
scientific article

    Statements

    A matching-based approach for solving a delivery/pick-up vehicle routing problem with time constraints (English)
    0 references
    0 references
    0 references
    0 references
    16 January 1993
    0 references
    vehicle routing
    0 references
    time window constraints
    0 references
    set partitioning
    0 references
    matching
    0 references
    non-smooth optimization
    0 references
    approximate solutions
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references