A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem (Q2314413): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Probabilistic Analysis of a Relaxation for the <i>k</i>-Median Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Set-Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A projection method for the uncapacitated facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Canonical Representation of Simple Plant Location Problems and Its Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some facets of the simple plant location polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Primal Approach to the Simple Plant Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3351135 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of heuristics and relaxations for the capacitated plant location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Locating Sources Among Destinations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dual-Based Procedure for Uncapacitated Facility Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138479 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A direct dual method for the mixed plant location problem with some side constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplex pivots on the set packing polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving covering problems and the uncapacitated plant location problem on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A man-machine approach toward solving the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Indirect Method for the Generalized <i>k</i>-Median Problem Applied to Lock-Box Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4132006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Cross Decomposition Algorithm for Capacitated Facility Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using a facility location algorithm to solve large set covering problems / rank
 
Normal rank

Latest revision as of 00:02, 20 July 2024

scientific article
Language Label Description Also known as
English
A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem
scientific article

    Statements

    A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem (English)
    0 references
    22 July 2019
    0 references
    0 references
    facility location
    0 references
    simplex algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references