Bundle-based relaxation methods for multicommodity capacitated fixed charge network design (Q5946817): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A generalization of Polyak's convergence result for subgradient optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382664 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models for planning capacity expansion in local access telecommunication networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated Network Design—Polyhedral Structure and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133397 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounding Procedures for Multiperiod Telecommunications Network Expansion Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bundle-based relaxation methods for multicommodity capacitated fixed charge network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simplex-Based Tabu Search Method for Capacitated Network Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4105990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527200 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On improvements to the analytic center cutting plane method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving semidefinite quadratic problems within nonsmooth optimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Bundle Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological design of telecommunication networks --- local access design methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving nonlinear multicommodity flow problems by the analytic center cutting plane method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition and Nondifferentiable Optimization with the Projective Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3960718 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validation of subgradient optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840281 / 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: Conditional subgradient optimization -- theory and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040780 / 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: Networks synthesis and optimum network design problems: Models, solution methods and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of unsmooth functionals / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results / rank
 
Normal rank

Latest revision as of 20:52, 3 June 2024

scientific article; zbMATH DE number 1660374
Language Label Description Also known as
English
Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
scientific article; zbMATH DE number 1660374

    Statements

    Bundle-based relaxation methods for multicommodity capacitated fixed charge network design (English)
    0 references
    0 references
    0 references
    0 references
    30 July 2002
    0 references
    0 references
    Network design
    0 references
    Capacitaded fixed-charge networks
    0 references
    Lagrangian relaxation
    0 references
    Subgradient methods
    0 references
    Bundle methods
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references