Optimal connected subgraphs: Integer programming formulations and polyhedra (Q6064164): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The Maximum Weight Connected Subgraph Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rooted Maximum Node-Weight Connected Subgraph Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral study of the connected subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Integer Programming Approach for Fault-Tolerant Connected Dominating Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for node‐weighted Steiner tree and maximum‐weight connected subgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Imposing Connectivity Constraints in Forest Planning Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connections in Networks: Hardness of Feasibility Versus Optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Connected Subgraph Problems in Wildlife Conservation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stronger path‐based extended formulation for the Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thinning out Steiner trees: a node-based model for uniform edge costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Steiner Tree Computation in Polynomial-Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer linear programming models for topology optimization in sheet metal design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Political Districting by Implicit Enumeration Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arborescence polytopes for series-parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A catalog of steiner tree formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness column: An ongoing guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Steiner tree problems in graphs to optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the steiner tree problem in directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Steiner trees: Recent advances, challenges, and perspectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of Steiner tree relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On imposing connectivity constraints in integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual ascent approach for steiner tree problems on a directed graph / rank
 
Normal rank

Revision as of 13:21, 21 August 2024

scientific article; zbMATH DE number 7776608
Language Label Description Also known as
English
Optimal connected subgraphs: Integer programming formulations and polyhedra
scientific article; zbMATH DE number 7776608

    Statements

    Optimal connected subgraphs: Integer programming formulations and polyhedra (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 December 2023
    0 references
    connected subgraph polytope
    0 references
    connected subgraphs
    0 references
    exact solution
    0 references
    induced connectivity
    0 references
    integrality
    0 references
    maximum-weight connected subgraph problem
    0 references
    Steiner tree problem
    0 references

    Identifiers

    0 references
    0 references
    0 references