Discrete multi-module capacitated lot-sizing problems with multiple items (Q2670496): 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.1016/j.orl.2022.01.002 / rank
Normal rank
 
Property / author
 
Property / author: Manish Bansal / rank
Normal rank
 
Property / author
 
Property / author: Manish Bansal / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Gurobi / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4205539366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets for single module and multi-module capacitated lot-sizing problems without backlogging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Second Stage Formulations in Two-Stage Stochastic Mixed Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of the Capacitated Lot Size Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-item dynamic lot-sizing problems: an updated survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The discrete lot-sizing and scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Production Planning with Concave Costs and Capacity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Production Planning: Algorithms and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting Planes for Multistage Stochastic Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixing mixed-integer inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lot Sizing with Piecewise Concave Production Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lot-Sizing with Constant Batches: Formulation and Valid Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Production Planning by Mixed Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4885531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The single-item discrete lotsizing and scheduling problem: Optimization by linear and dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Single-Item Lot-Sizing Problems with Constant Batch Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4254875 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ORL.2022.01.002 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:01, 19 December 2024

scientific article
Language Label Description Also known as
English
Discrete multi-module capacitated lot-sizing problems with multiple items
scientific article

    Statements

    Discrete multi-module capacitated lot-sizing problems with multiple items (English)
    0 references
    0 references
    0 references
    11 March 2022
    0 references
    multi-module capacitated lot-sizing with backlogging
    0 references
    multi-item discrete lot-sizing problem
    0 references
    fixed-parameter tractable algorithm
    0 references
    concave production and holding costs
    0 references
    dynamic programming
    0 references
    0 references
    0 references
    0 references

    Identifiers