A polyhedral study of lot-sizing with supplier selection (Q448963): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Diego Klabjan / 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.disopt.2011.09.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1982577425 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Production Planning by Mixed Integer Programming / 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: Modelling piecewise linear concave costs in a tree partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds in Lot-Sizing Models: A Polyhedral Study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lot-size models with backlogging: Strong reformulations and cutting planes / 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: Lotsizing with backlogging and start-ups: The case of Wagner-Whitin costs / 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: Valid inequalities and separation for capacitated economic lot sizing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra / 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: Lot-Sizing with Constant Batches: Formulation and Valid Inequalities / 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: Graph Theory and Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The uncapacitated lot-sizing problem with sales and safety stocks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4840775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid inequalities for mixed 0-1 programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow pack facets of the single node fixed-charge flow polytope / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:48, 5 July 2024

scientific article
Language Label Description Also known as
English
A polyhedral study of lot-sizing with supplier selection
scientific article

    Statements

    A polyhedral study of lot-sizing with supplier selection (English)
    0 references
    0 references
    0 references
    11 September 2012
    0 references
    lot-sizing
    0 references
    polyhedral analysis
    0 references
    facet-defining
    0 references

    Identifiers