Models and heuristics for the <i>k</i> ‐degree constrained minimum spanning tree problem with node‐degree costs (Q4648687): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: PERL / 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.1002/net.20445 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2153740982 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability distribution of solution time in GRASP: an experimental investigation / rank
 
Normal rank
Property / cites work
 
Property / cites work: TTT plots: a perl program to create time-to-target plots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity network design with discrete node costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reformulation by discretization: application to economic lot sizing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the variable size bin packing problem with discretized formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower and upper bounds for the degree-constrained minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy randomized adaptive search procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: An annotated bibliography of GRASP – Part I: Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An annotated bibliography of GRASP-Part II: Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: 0-1 reformulations of the multicommodity capacitated network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the capacitated concentrator location problem: a reformulation by discretization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable Neighborhood Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying the pilot method to improve VNS and GRASP metaheuristics for the design of SDH/WDM networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic approach for combined equipment-planning and routing in multi-layer SDH/WDM networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling and Solving the Two-Facility Capacitated Network Loading Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search for the degree-constrained minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge exchanges in the degree-constrained minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation / rank
 
Normal rank

Latest revision as of 22:11, 5 July 2024

scientific article; zbMATH DE number 6107798
Language Label Description Also known as
English
Models and heuristics for the <i>k</i> ‐degree constrained minimum spanning tree problem with node‐degree costs
scientific article; zbMATH DE number 6107798

    Statements

    Models and heuristics for the <i>k</i> ‐degree constrained minimum spanning tree problem with node‐degree costs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    15 November 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    spanning tree
    0 references
    discretized reformulation
    0 references
    knapsack reformulation
    0 references
    GRASP
    0 references
    VNS
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references