A cutting plane algorithm for the capacitated facility location problem (Q842775): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10589-007-9125-x / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: OR-Library / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Qhull / 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-007-9125-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2017019823 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated facility location: Separation algorithms and computational experience / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated Facility Location: Valid Inequalities and Facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The volume algorithm: Producing primal solutions with a subgradient method / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective heuristic for large-scale capacitated facility location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational study of large-scale \(p\)-median problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quickhull algorithm for convex hulls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean heuristics for location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263705 / 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 branch-and-price algorithm for the capacitated facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid inequalities and facets of the capacitated plant location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 0-1 knapsack problem with a single continuous variable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10589-007-9125-X / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:56, 10 December 2024

scientific article
Language Label Description Also known as
English
A cutting plane algorithm for the capacitated facility location problem
scientific article

    Statements

    A cutting plane algorithm for the capacitated facility location problem (English)
    0 references
    0 references
    0 references
    25 September 2009
    0 references
    capacitated facility location problem
    0 references
    mixed dicut inequalities
    0 references
    facet-enumeration
    0 references
    0 references
    0 references

    Identifiers