Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem

DOI10.1007/s10898-007-9254-xzbMath1159.90012OpenAlexW2034355834MaRDI QIDQ1016064

April K. Andreas, Simge Küçükyavuz, J. Cole Smith

Publication date: 4 May 2009

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-007-9254-x

zbMATH Keywords

reliabilitynonconvex optimizationnetwork optimizationbranch-and-price-and-cut

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Stochastic network models in operations research (90B15)

Related Items

A global optimization algorithm for reliable network design, Network Design with Service Requirements: Scaling-up the Size of Solvable Problems, Optimal Network Design with End-to-End Service Requirements, On the chance-constrained minimum spanning \(k\)-core problem, Optimization algorithms for resilient path selection in networks

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Branching in branch-and-price: A generic scheme
• An equivalent subproblem relaxation for improving the solution of a class of transportation scheduling problems
• Probabilistic shortest path problems with budgetary constraints
• The directed subgraph homeomorphism problem
• A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
• Two engineering applications of a constrained shortest-path model
• An exact algorithm for IP column generation
• A technical review of column generation in integer programming
• Algorithms for the Weight Constrained Shortest Path Problem
• Improving Discrete Model Representations via Symmetry Considerations
• A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
• Disjoint paths in a network
• Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
• Selected Topics in Column Generation
• An Algorithm for Separable Nonconvex Programming Problems