Reachability cuts for the vehicle routing problem with time windows (Q2432846): 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: CVRPSEP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CVRPSP / 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.2005.04.022 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2150176315 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational investigations of maximum flow algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the asymmetric travelling salesman problem with time windows by branch-and-cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: The precedence-constrained asymmetric traveling salesman polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-Path Cuts for the Vehicle Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projection results for vehicle routing / 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: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints / rank
 
Normal rank

Latest revision as of 21:14, 24 June 2024

scientific article
Language Label Description Also known as
English
Reachability cuts for the vehicle routing problem with time windows
scientific article

    Statements

    Reachability cuts for the vehicle routing problem with time windows (English)
    0 references
    0 references
    25 October 2006
    0 references
    routing
    0 references
    time windows
    0 references
    precedence constraints
    0 references
    0 references
    0 references
    0 references

    Identifiers