Vertex covering with capacitated trees (Q6179715): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/net.22130 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4308862136 / rank
 
Normal rank
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: A relax-and-cut framework for large-scale maximum weight connected subgraph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integer linear programming approach to the steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The balanced 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: Optimal duty rostering for toll enforcement inspectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extended network interdiction problem for optimal toll control / 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: On implementing push-relabel method for the maximum flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Steiner Tree Problem on a Graph Using Branch and Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact approaches for solving a covering problem with capacitated subtrees / 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: Steiner Tree Problems With Profits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining optimal police patrol areas with maximal covering and backup covering location models / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simulated annealing approach to police district design / 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: Models and heuristics for a minimum arborescence 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: Solving a large scale districting problem: A case report / 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: The Steiner tree polytope and related polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: A catalog of steiner tree formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster analysis and mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4763403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed-integer programming techniques for the connected max-\(k\)-cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Optimization Problems: Algorithms, Applications and Complexity / 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: Greedoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the constrained maximum-weight connected graph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4248932 / 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: An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3760270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong formulations for network design problems with connectivity requirements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimization Based Heuristic for Political Districting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning a graph into balanced connected classes: formulations, separation and experiments / 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 comparison of Steiner tree relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3638643 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances / 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: Reduction techniques for the prize collecting Steiner tree problem and the maximum-weight connected subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Political districting: from classical models to recent approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: New models for commercial territory design / rank
 
Normal rank
Property / cites work
 
Property / cites work: An overview of graph covering and partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4540048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Political districting to minimize cut edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Imposing Contiguity Constraints in Political Districting Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multivariate <i>L</i> <sub>1</sub> -median and associated data depth / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:48, 21 August 2024

scientific article; zbMATH DE number 7780113
Language Label Description Also known as
English
Vertex covering with capacitated trees
scientific article; zbMATH DE number 7780113

    Statements

    Vertex covering with capacitated trees (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    18 December 2023
    0 references
    column generation
    0 references
    connected subgraphs
    0 references
    districting
    0 references
    graph covering
    0 references
    integer programming
    0 references
    maximum weight connected subgraph
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references