The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches (Q2427392): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10589-007-9072-6 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: SolvOpt / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: K_TREE/K_SUBGRAPH / 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.1007/s10589-007-9072-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2163625245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Steiner tree problems in graphs with Lagrangian relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The volume algorithm revisited: relation with bundle methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: The prize collecting traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The volume algorithm: Producing primal solutions with a subgradient method / rank
 
Normal rank
Property / cites work
 
Property / cites work: An SST-based algorithm for the steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the prize collecting traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New metaheuristic approaches for the edge-weighted \(k\)-cardinality tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search algorithms for the \(k\)-cardinality tree problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing Matrices into Blocks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133397 / 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: Q4105990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving group Steiner problems as Steiner problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(K\)-tree/\(K\)-subgraph: A program package for minimal weighted \(K\)-cardinlity trees and subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparative analysis of several formulations for the generalized minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted <i>k</i>‐cardinality trees: Complexity and polyhedral structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer programming approaches to facilities layout models with forbidden areas / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: On convergence rates of subgradient optimization methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean decomposition: A model yielding stronger lagrangean bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper and lower bounding strategies for the generalized minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validation of subgradient optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation scheme for the Group Steiner Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3141900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Class Steiner trees and VLSI-design / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Primal Simplex Algorithm for Maximum Weighted Vertex Packing on Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4216482 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangian duality applied to the vehicle routing problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implementation of Shor's \(r\)-algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper and lower bounding procedures for minimum rooted \(k\)-subtree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cutting-Plane Method for Solving Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable metric bundle methods: From conceptual to implementable forms / 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: Strong lower bounds for the prize collecting Steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The B<scp>oxstep</scp> Method for Large-Scale Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Constrained Optimization with Semismooth Functions / 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: Q5566712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of unsmooth functionals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4694752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the generalized Steiner tree polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: The node-weighted steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limited memory space dilation and reduction algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variable target value method for nondifferentiable optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjugate gradient methods using quasi-Newton updates with inexact line searches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5655195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence rate of the gradient descent method with dilatation of the space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5643809 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5181564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The class Steiner minimal tree problem: A lower bound and test problem generation / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10589-007-9072-6 / rank
 
Normal rank

Latest revision as of 13:55, 18 December 2024

scientific article
Language Label Description Also known as
English
The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
scientific article

    Statements

    The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches (English)
    0 references
    0 references
    0 references
    0 references
    13 May 2008
    0 references
    Lagrangian decomposition
    0 references
    nondifferentiable optimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers