Routing by ranking: a link analysis method for the constrained dial-a-ride problem (Q2450754): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: VRPH / 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.orl.2013.09.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2029164359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The counting complexity of a simple scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Dial-a-Ride Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The pickup and delivery problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Authority Rankings from HITS, PageRank, and SALSA: Existence, Uniqueness, and Effect of Initialization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh / rank
 
Normal rank
Property / cites work
 
Property / cites work: A library of local search heuristics for the vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient feasibility testing for dial-a-ride problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Eigenvector Methods for Web Information Retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-Avoiding Paths and the Adjacency Matrix of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic Algorithms for the Handicapped Persons Transportation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:15, 8 July 2024

scientific article
Language Label Description Also known as
English
Routing by ranking: a link analysis method for the constrained dial-a-ride problem
scientific article

    Statements

    Routing by ranking: a link analysis method for the constrained dial-a-ride problem (English)
    0 references
    0 references
    0 references
    15 May 2014
    0 references
    0 references
    dial-a-ride problem
    0 references
    link analysis
    0 references
    hits
    0 references
    topological ordering
    0 references
    0 references