A matheuristic for the MinMax capacitated open vehicle routing problem (Q6066715): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q129423823, #quickstatements; #temporary_batch_1727093369807
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: A survey of scheduling problems with no-wait in process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of a Min-Max Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on matheuristics for routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximations for minimum and min-max vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5271458 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-Max vs. Min-Sum vehicle routing: a worst-case analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A set covering based matheuristic for a real‐world city logistics problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4656643 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Truck Dispatching Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2759924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: The <i>m</i>-Traveling Salesman Problem with Minmax Objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive memory heuristic for a class of vehicle routing problems with minmax objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-objective vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: School bus routing—a column generation approach / 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: A multi-start algorithm for a balanced real-world open vehicle routing problem / 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: Tabu search for a multi-objective routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic method for the open vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matheuristics for the capacitated p‐median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5191184 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metaheuristics for bi-level optimization / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129423823 / rank
 
Normal rank

Latest revision as of 14:28, 23 September 2024

scientific article; zbMATH DE number 7766429
Language Label Description Also known as
English
A matheuristic for the MinMax capacitated open vehicle routing problem
scientific article; zbMATH DE number 7766429

    Statements

    A matheuristic for the MinMax capacitated open vehicle routing problem (English)
    0 references
    0 references
    0 references
    16 November 2023
    0 references
    vehicle routing problem
    0 references
    matheuristic
    0 references
    COVRP
    0 references
    minmax objective
    0 references

    Identifiers