Fast bounding procedures for large instances of the simple plant location problem (Q1762067): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(8 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2011.06.014 / rank
Normal rank
 
Property / Wikidata QID
 
Property / Wikidata QID: Q57702160 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: heapsort / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: OR-Library / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2150589502 / rank
 
Normal rank
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: An algorithm for solving large capacitated warehouse location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean heuristics for location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4139967 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for a generalization of the uncapacitated facility location 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: Q3351135 / 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: Branch and peg algorithms for the simple plant location problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the simple plant location problem using a data correcting approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5650510 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the exact solution of large-scale simple plant location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The simple plant location problem: Survey and synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the simple plant location problem by genetic algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Metric Facility Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on duality gap in the simple plant location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of a 532-city symmetric traveling salesman problem by branch and cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the uncapacitated facility location problem using tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implementation of the simplex method for linear programming problems with variable upper bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dual-Based Procedure for Dynamic Facility Location / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/cor/LetchfordM12 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2011.06.014 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:12, 11 December 2024

scientific article
Language Label Description Also known as
English
Fast bounding procedures for large instances of the simple plant location problem
scientific article

    Statements

    Fast bounding procedures for large instances of the simple plant location problem (English)
    0 references
    0 references
    0 references
    15 November 2012
    0 references
    combinatorial optimisation
    0 references
    facility location
    0 references
    dual ascent
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers