A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times (Q2830951): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1287/ijoc.2016.0691 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2395192183 / 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: Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems / 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: Branch-and-Price: Column Generation for Solving Huge Integer Programs / 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: Automatic Dantzig-Wolfe reformulation of mixed integer programs / 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: Decomposition Principle for Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times / 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: Stabilized column generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Aggregation of Set-Partitioning Constraints in 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: Lagrangean decomposition: A model yielding stronger lagrangean bounds / 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: A Lower Bounding Structure for Lot-Size Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimality Conditions for Discrete and Nonconvex Optimization—With Applications to Lagrangian Heuristics and Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selected Topics in Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation / 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: Lagrangean relaxation based heuristics for lot sizing with setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lot-Sizing with Start-Up Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing Mixed Integer Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching in branch-and-price: A generic scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generic view of Dantzig--Wolfe decomposition in mixed integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate extended formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On compact formulations for integer programs solved by column generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Version of the Economic Lot Size Model / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1287/IJOC.2016.0691 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:19, 20 December 2024

scientific article
Language Label Description Also known as
English
A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times
scientific article

    Statements

    A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times (English)
    0 references
    0 references
    0 references
    0 references
    1 November 2016
    0 references
    algorithms
    0 references
    lot sizing
    0 references
    branch and price
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references