The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach (Q1926737): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2012.01.035 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2075270503 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster, Better Approximation Algorithm for the Minimum Latency Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Schemes for Minimum Latency Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem with cumulative costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum latency problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm for the Traveling Salesman Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Delivery Man Problem and Cumulative Matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new dominance procedure for combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the car sequencing problem via branch \& bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the traveling repairman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation ratio for the minimum latency problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5704408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem and its variations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Representatives of Subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new formulation for the traveling deliveryman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The delivery man problem on a tree network / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for the minimum latency problem / rank
 
Normal rank

Latest revision as of 01:28, 6 July 2024

scientific article
Language Label Description Also known as
English
The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach
scientific article

    Statements

    The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 December 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    branch and bound
    0 references
    vehicle routing problem
    0 references
    toll-by-weight
    0 references
    0 references
    0 references
    0 references