Lagrangian relaxation and enumeration for solving constrained shortest-path problems (Q3548726): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1002/net.20247 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4246153096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest chain subject to side constraints / 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: Near-shortest and K-shortest simple paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flight Attendant Rostering for Short-Haul Airline Operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching for the Multiplier in One-Constraint Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Column Generation Approach for Large-Scale Aircrew Rostering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient implementation of an algorithm for findingK shortest simple paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for finding paths with multiple constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The shortest route problem with constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time depending shortest-path problems with applications to railway networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation and efficiency of Moore-algorithms for the shortest route problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Airline Crew Scheduling: A New Formulation and Decomposition Algorithm / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:59, 28 June 2024

scientific article
Language Label Description Also known as
English
Lagrangian relaxation and enumeration for solving constrained shortest-path problems
scientific article

    Statements

    Lagrangian relaxation and enumeration for solving constrained shortest-path problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 December 2008
    0 references
    near-shortest paths
    0 references
    label-setting algorithm
    0 references

    Identifiers