Exploring the constrained maximum edge-weight connected graph problem (Q1048254): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10255-008-8829-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2402871347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using a Hop-Constrained Model to Generate Alternative Communication Network Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Additive Algorithm for Solving Linear Programs with Zero-One Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search with perturbations for the prize-collecting Steiner tree problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5692514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interconnecting Highways / 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: The Structure and Function of Complex Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem / rank
 
Normal rank

Latest revision as of 09:20, 2 July 2024

scientific article
Language Label Description Also known as
English
Exploring the constrained maximum edge-weight connected graph problem
scientific article

    Statements

    Exploring the constrained maximum edge-weight connected graph problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 January 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    connected subgraph
    0 references
    integer linear programming model
    0 references
    network flow
    0 references
    constraint Steiner network
    0 references
    maximum edge weight
    0 references
    heuristic algorithm
    0 references
    0 references