Exact algorithms for integrated facility location and production planning problems (Q5198685): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2116415271 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A composite algorithm for a concave-cost network flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-Price: Column Generation for Solving Huge Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the dynamic facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857376 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4427313 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Requirements Planning with Pricing and Order Selection Flexibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Programming Approach to the Cutting-Stock Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The continuous-time single-sourcing problem with capacity expansion opportunities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Production and Inventory Models with Piecewise Concave Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic analysis of the multi-period single-sourcing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An asymptotically optimal greedy heuristic for the multiperiod single-sourcing problem: The cyclic case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic analysis of a greedy heuristic for the multi-period single-sourcing problem: The acyclic case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrating facility location and production planning decisions / 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: A Branch-and-Price Algorithm for the Generalized Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Transportation-Inventory Network Design Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Version of the Economic Lot Size Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-item, multi-facility supply chain planning: Models, complexities, and algorithms / rank
 
Normal rank

Latest revision as of 08:50, 4 July 2024

scientific article; zbMATH DE number 5937344
Language Label Description Also known as
English
Exact algorithms for integrated facility location and production planning problems
scientific article; zbMATH DE number 5937344

    Statements

    Exact algorithms for integrated facility location and production planning problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 August 2011
    0 references
    facility location
    0 references
    production planning
    0 references
    branch and price
    0 references
    order selection
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references