Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems

DOI10.1007/s10589-016-9836-yzbMath1353.90168OpenAlexW2296210203WikidataQ42405487 ScholiaQ42405487MaRDI QIDQ316168

Markus Leitner

Publication date: 26 September 2016

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-016-9836-y

zbMATH Keywords

mixed integer linear programmingbranch-and-cutsurvivabilitybiconnectivitygeneralized network design

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (1)

Branch-and-cut methods for the network design problem with vulnerability constraints

Uses Software

• TSPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem
• Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem
• New models of the generalized minimum spanning tree problem
• A tabu search heuristic for the generalized minimum spanning tree problem
• Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem
• On implementing the push-relabel method for the maximum flow problem
• Generalized network design problems.
• A new relaxation method for the generalized minimum spanning tree problem
• Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice
• Heuristic Search for the Generalized Minimum Spanning Tree Problem
• The generalized minimum edge-biconnected network problem: Efficient neighborhood structures for variable neighborhood search
• The Generalized Traveling Salesman Problem: A New Genetic Algorithm Approach
• TSPLIB—A Traveling Salesman Problem Library
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
• A directed cycle-based column-and-cut generation method for capacitated survivable network design
• On the generalized minimum spanning tree problem
• Point Measurements for a Neumann-to-Dirichlet Map and the Calderón Problem in the Plane
• Design of Survivable Networks: A survey
• On generalized minimum spanning trees

This page was built for publication: Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems