An efficient exact approach for the constrained shortest path tour problem (Q4972542): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q128555904, #quickstatements; #temporary_batch_1723663638014
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Some constrained shortest-route problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the resource constrained shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of resource constrained shortest path problems: Exact solution approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic heuristic for a computationally difficult set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy randomized adaptive search procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The constrained shortest path tour problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybridizations of GRASP with path relinking for the far from most string problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity analysis and optimization of the shortest path tour problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the shortest path tour problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2776563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual algorithm for the constrained shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network survivability modeling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid particle swarm optimization -- variable neighborhood search algorithm for constrained shortest path problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mersenne twister / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128555904 / rank
 
Normal rank

Latest revision as of 20:58, 14 August 2024

scientific article; zbMATH DE number 7136206
Language Label Description Also known as
English
An efficient exact approach for the constrained shortest path tour problem
scientific article; zbMATH DE number 7136206

    Statements

    An efficient exact approach for the constrained shortest path tour problem (English)
    0 references
    0 references
    0 references
    0 references
    25 November 2019
    0 references
    shortest path problems
    0 references
    shortest path tour problem
    0 references
    capacity constraints
    0 references
    branch \& bound
    0 references

    Identifiers