Partial objective inequalities for the multi-item capacitated lot-sizing problem (Q1652548): 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 / describes a project that uses
 
Property / describes a project that uses: bc-prod / 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.1016/j.cor.2017.11.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2769830667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational analysis of lower bounds for big bucket production planning problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-item lot-sizing with joint set-up costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study of the lot-sizing polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the knapsack polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Formulations for Multi-Item Capacitated Lot Sizing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncapacitated lot-sizing: The convex hull of solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming approximation algorithms for the capacitated lot-sizing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Convex Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane approach to capacitated lot-sizing with start-up costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral approach to a production planning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Nonlinear Fractional Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the independent set polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Production Planning: Algorithms and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric approaches to fractional programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets and algorithms for capacitated lot sizing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic knapsack sets and capacitated lot-sizing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral Characterization of Discrete Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the polyhedral structure of a multi-item production planning model with setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid Linear Inequalities for Fixed Charge Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid inequalities and separation for capacitated economic lot sizing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes / 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: Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxations for two-level multi-item lot-sizing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:15, 16 July 2024

scientific article
Language Label Description Also known as
English
Partial objective inequalities for the multi-item capacitated lot-sizing problem
scientific article

    Statements

    Partial objective inequalities for the multi-item capacitated lot-sizing problem (English)
    0 references
    0 references
    0 references
    11 July 2018
    0 references
    mixed-integer programming
    0 references
    dynamic programming
    0 references
    cutting planes
    0 references
    valid inequalities
    0 references
    partial objective cuts
    0 references
    \((l, s)\) inequalities
    0 references
    polyhedral study
    0 references
    branch-and-cut
    0 references
    multi-item
    0 references
    capacitated lot-sizing
    0 references
    production planning
    0 references

    Identifiers

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