Exactly solving a two-level location problem with modular node capacities (Q2892154): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Knapsack / 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: SCIP / 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/net.20486 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2011781861 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing a distribution network in a supply chain system: formulation and efficient solution procedure / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational evaluation of a general branch-and-price framework for capacitated network location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper and lower bounds for the two-level simple plant location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangean heuristic for a modular capacitated location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discretized formulations for capacitated location problems with modular distribution costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for the \(k\)-level capacitated facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approximation algorithm for the multilevel facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formulations and relaxations for a multi-echelon capacitated location-distribution problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the capacitated concentrator location problem: a reformulation by discretization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the capacitated facility location problems with single sourcing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower and upper bounds for a two-level hierarchical location problem in computer networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facility location models for distribution system design / rank
 
Normal rank
Property / cites work
 
Property / cites work: New facets for the two-stage uncapacitated facility location polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Minimal Algorithm for the 0-1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review of hierarchical facility location models / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound algorithm for the multi-level uncapacitated facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact method for the two-echelon, single-source, capacitated facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Extra Dual Cuts to Accelerate Column Generation / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:18, 5 July 2024

scientific article
Language Label Description Also known as
English
Exactly solving a two-level location problem with modular node capacities
scientific article

    Statements

    Exactly solving a two-level location problem with modular node capacities (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    18 June 2012
    0 references
    0 references
    location
    0 references
    discretization
    0 references
    column generation
    0 references
    branch-and-price
    0 references
    telecommunications
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references