An aggressive reduction scheme for the simple plant location problem (Q2514768): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57702142 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2013.10.020 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2047629593 / 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: Pivot and Complement–A Heuristic for 0-1 Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming: Methods, Uses, Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean heuristics for location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-Lagrangian relaxation applied to the uncapacitated facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4139967 / 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: Q3993417 / 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: A method for solving to optimality uncapacitated location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighborhood search heuristics for the uncapacitated facility location problem / 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: 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: Q5687198 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast bounding procedures for large instances of the simple plant location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facility siting and integer-friendly programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4132006 / 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 / cites work
 
Property / cites work: Uncapacitated and Capacitated Facility Location Problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:10, 9 July 2024

scientific article
Language Label Description Also known as
English
An aggressive reduction scheme for the simple plant location problem
scientific article

    Statements

    An aggressive reduction scheme for the simple plant location problem (English)
    0 references
    0 references
    0 references
    3 February 2015
    0 references
    facility location
    0 references
    combinatorial optimization
    0 references
    integer programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers