Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems (Q316168): 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/s10589-016-9836-y / 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 / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C57 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6629781 / rank
 
Normal rank
Property / zbMATH Keywords
 
generalized network design
Property / zbMATH Keywords: generalized network design / rank
 
Normal rank
Property / zbMATH Keywords
 
survivability
Property / zbMATH Keywords: survivability / rank
 
Normal rank
Property / zbMATH Keywords
 
biconnectivity
Property / zbMATH Keywords: biconnectivity / rank
 
Normal rank
Property / zbMATH Keywords
 
branch-and-cut
Property / zbMATH Keywords: branch-and-cut / rank
 
Normal rank
Property / zbMATH Keywords
 
mixed integer linear programming
Property / zbMATH Keywords: mixed integer linear programming / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: TSPLIB / 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/s10589-016-9836-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2296210203 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q42405487 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On implementing the push-relabel method for the maximum flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generalized minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized network design problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Point Measurements for a Neumann-to-Dirichlet Map and the Calderón Problem in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic Search for the Generalized Minimum Spanning Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design of Survivable Networks: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized minimum edge-biconnected network problem: Efficient neighborhood structures for variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the generalized minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search heuristic for the generalized minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4448919 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New models of the generalized minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new relaxation method for the generalized minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A directed cycle-based column-and-cut generation method for capacitated survivable network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Generalized Traveling Salesman Problem: A New Genetic Algorithm Approach / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10589-016-9836-Y / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:06, 9 December 2024

scientific article
Language Label Description Also known as
English
Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems
scientific article

    Statements

    Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems (English)
    0 references
    0 references
    26 September 2016
    0 references
    generalized network design
    0 references
    survivability
    0 references
    biconnectivity
    0 references
    branch-and-cut
    0 references
    mixed integer linear programming
    0 references
    0 references
    0 references

    Identifiers