Solving the \(p\)-median problem with a semi-Lagrangian relaxation (Q853887): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: TSPLIB / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MEX-file / 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-006-6513-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2008919321 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(p\)-median polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Optimal Diversity Management Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A family of facets for the uncapacitated \(p\)-median polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178782 / 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: Lagrangean decomposition: A model yielding stronger lagrangean bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster analysis and mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood decomposition search / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithmic Approach to Network Location Problems. II: The<i>p</i>-Medians / 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: Q4737540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A practical algorithm for computing a subadditive dual function for set partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: A geometric study of dual gaps, with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster Analysis: An Application of Lagrangian Relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank

Latest revision as of 22:18, 24 June 2024

scientific article
Language Label Description Also known as
English
Solving the \(p\)-median problem with a semi-Lagrangian relaxation
scientific article

    Statements

    Solving the \(p\)-median problem with a semi-Lagrangian relaxation (English)
    0 references
    0 references
    0 references
    0 references
    17 November 2006
    0 references
    Lagrangian relaxation
    0 references
    combinatorial optimization
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers