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

From MaRDI portal
Created claim: Wikidata QID (P12): Q42405487, #quickstatements; #temporary_batch_1712101902020
ReferenceBot (talk | contribs)
Changed an Item
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

Revision as of 14:30, 12 July 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