Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem (Q1016064): 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.1007/s10898-007-9254-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2034355834 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic shortest path problems with budgetary constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4395334 / 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: Q5687193 / 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: Algorithms for the Weight Constrained Shortest Path Problem / 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: Two engineering applications of a constrained shortest-path model / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Separable Nonconvex Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The directed subgraph homeomorphism problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An equivalent subproblem relaxation for improving the solution of a class of transportation scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selected Topics in Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving Discrete Model Representations via Symmetry Considerations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint paths in a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching in branch-and-price: A generic scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for IP column generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A technical review of column generation in integer programming / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:30, 1 July 2024

scientific article
Language Label Description Also known as
English
Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem
scientific article

    Statements

    Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem (English)
    0 references
    0 references
    0 references
    0 references
    4 May 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    nonconvex optimization
    0 references
    branch-and-price-and-cut
    0 references
    network optimization
    0 references
    reliability
    0 references
    0 references