The quadratic shortest path problem: complexity, approximability, and solution methods (Q1754341): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On minimum reload cost paths, tours, and flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximation properties of the Independent set problem for degree 3 graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained 0-1 quadratic programming: basic approaches and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Lower Bound for the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding reliable shortest paths in road networks under uncertainty / 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: Q4479208 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Linear Integer Programming Formulations of Nonlinear Integer Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum reload \(s-t\) path, trail and walk problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-cost flow algorithms: an experimental evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner travelling salesman problem with correlated costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Variance-Constrained Shortest Path Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mean-Variance Model for Route Guidance in Advanced Traveler Information Systems / rank
 
Normal rank

Latest revision as of 17:33, 15 July 2024

scientific article
Language Label Description Also known as
English
The quadratic shortest path problem: complexity, approximability, and solution methods
scientific article

    Statements

    The quadratic shortest path problem: complexity, approximability, and solution methods (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    30 May 2018
    0 references
    combinatorial optimization
    0 references
    shortest path problem
    0 references
    quadratic 0-1 optimization
    0 references
    computational complexity
    0 references
    branch-and-bound
    0 references

    Identifiers

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