A branch-and-cut algorithm for the time window assignment vehicle routing problem (Q1652456): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2017.08.015 / rank
Normal rank
 
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 / OpenAlex ID
 
Property / OpenAlex ID: W2753434807 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral study of the asymmetric traveling salesman problem with time windows / 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: An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic vehicle routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-imposed time windows in vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological sorting of large networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Routing under Capacity and Distance Restrictions / 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: Integer Programming Formulation of Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Euclidean traveling salesman problem is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: The discrete time window assignment vehicle routing problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2017.08.015 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:06, 11 December 2024

scientific article
Language Label Description Also known as
English
A branch-and-cut algorithm for the time window assignment vehicle routing problem
scientific article

    Statements

    A branch-and-cut algorithm for the time window assignment vehicle routing problem (English)
    0 references
    0 references
    0 references
    11 July 2018
    0 references
    vehicle routing
    0 references
    time window assignment
    0 references
    precedence inequalities
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references