Analysis of relaxations for the multi-item capacitated lot-sizing problem (Q922259): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facility location models for distribution planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Computational Comparison among Three Multicommodity Network Flow Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of lower bounding methodologies for production/inventory models / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cyclical scheduling heuristic for lot sizing with capacity constraints / 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: Projected Newton methods and optimization of multicommodity flows / 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: The Multi-Item Capacitated Lot Size Problem: Error Bounds of Manne's Formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Production Scheduling by the Transportation Method of Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized upper bounding techniques / 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: Deterministic Production Planning with Concave Costs and Capacity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Stage Production Planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: `` Strong '' NP-Completeness Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity Distribution System Design by Benders Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Lagrangean Techniques to Solve Hierarchical Production Planning Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finiteness in restricted simplicial decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validation of subgradient optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of the frank and Wolfe method of feasible directions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Linear Cost Multicommodity Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3968758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lower Bounding Structure for Lot-Size Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Algorithm for Multi-Item Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition / 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: Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5603731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis Of Lagrangian Decomposition For The Multi-Item Capacitated Lot-Sizing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplicial decomposition in nonlinear programming algorithms / 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: A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02248584 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2091212366 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:26, 30 July 2024

scientific article
Language Label Description Also known as
English
Analysis of relaxations for the multi-item capacitated lot-sizing problem
scientific article

    Statements

    Analysis of relaxations for the multi-item capacitated lot-sizing problem (English)
    0 references
    1990
    0 references
    multi-item capacitated lot-sizing
    0 references
    Lagrangian relaxation
    0 references
    computational comparison
    0 references
    column generation
    0 references
    subgradient optimization
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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