Exact methods for solving the elementary shortest and longest path problems (Q512936): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(9 intermediate revisions by 8 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10479-016-2116-5 / rank
Normal rank
 
Property / author
 
Property / author: Yves Deville / rank
Normal rank
 
Property / author
 
Property / author: Yves Deville / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C11 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6691214 / rank
 
Normal rank
Property / zbMATH Keywords
 
elementary shortest path
Property / zbMATH Keywords: elementary shortest path / rank
 
Normal rank
Property / zbMATH Keywords
 
elementary longest path
Property / zbMATH Keywords: elementary longest path / rank
 
Normal rank
Property / zbMATH Keywords
 
negative cycles
Property / zbMATH Keywords: negative cycles / rank
 
Normal rank
Property / zbMATH Keywords
 
mixed integer programming
Property / zbMATH Keywords: mixed integer programming / rank
 
Normal rank
Property / zbMATH Keywords
 
decomposition
Property / zbMATH Keywords: decomposition / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: VRP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SteinLib / rank
 
Normal rank
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.1007/s10479-016-2116-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2273056006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching rules revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lifting procedure for asymmetric traveling salesman polytope and a large new class of facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent exact algorithms for solving the vehicle routing problem under capacity and time window 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: Mixed-integer nonlinear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the prize collecting traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated label setting algorithms for the elementary resource constrained shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction tests for the prize-collecting Steiner problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner Tree Problems With Profits / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving elementary shortest-path problems as mixed-integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / 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: Facets of the Asymmetric Traveling Salesman Polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461906 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4763416 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strong flow-based formulation for the shortest path problem in digraphs with negative cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest Path Problems with Resource Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and cut algorithm for the Steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximating the longest path in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Steiner tree problems in graphs to optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming Formulation of Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2861509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of a 532-city symmetric traveling salesman problem by branch and cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facet identification for the symmetric traveling salesman polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Odd Minimum Cut-Sets and <i>b</i>-Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: New dynamic programming algorithms for the resource constrained elementary shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Vehicle Routing Problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10479-016-2116-5 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:00, 9 December 2024

scientific article
Language Label Description Also known as
English
Exact methods for solving the elementary shortest and longest path problems
scientific article

    Statements

    Exact methods for solving the elementary shortest and longest path problems (English)
    0 references
    0 references
    0 references
    0 references
    3 March 2017
    0 references
    elementary shortest path
    0 references
    elementary longest path
    0 references
    negative cycles
    0 references
    mixed integer programming
    0 references
    decomposition
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers