Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times (Q3458742): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: LP-based heuristics for the capacitated lot-sizing problem: The interaction of model formulation and solution algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The volume algorithm: Producing primal solutions with a subgradient method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Plant location with minimum inventory / 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: bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual-Optimal Inequalities for Stabilized Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic capacitated lot-sizing problems: a classification and review of solution approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4105990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring relaxation induced neighborhoods to improve MIP solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Integer Solutions to Industrial Cutting-Stock Problems: Part 2, Benchmark Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: On alternative mixed integer programming formulations and LP-based heuristics for lot-sizing with setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence of the LP relaxations of two strong formulations for the capacitated lot-sizing problem with setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stabilized column generation / 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: Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for determining the convex hull of a finite planar set / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining Column Generation and Lagrangian Relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved lower bounds for the capacitated lot sizing problem with setup times. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4139966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities / 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: On the polyhedral structure of a multi-item production planning model with setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing Dantzig–Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Heuristic for Production Planning Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Multiple-Choice Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collaborative Planning - Concepts, Framework and Challenges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean relaxation based heuristics for lot sizing with setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate extended formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lot-Sizing with Start-Up Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncapacitated Lot-Sizing Problems with Start-Up Costs / rank
 
Normal rank

Latest revision as of 06:18, 11 July 2024

scientific article
Language Label Description Also known as
English
Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times
scientific article

    Statements

    Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 December 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    lot sizing
    0 references
    column generation
    0 references
    Lagrange relaxation
    0 references
    branch and price
    0 references
    heuristics
    0 references
    0 references
    0 references
    0 references
    0 references