Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems (Q2960369): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A heuristic approach for big bucket multi-level production planning 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: Split closure and intersection cuts / 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: Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solutions to linear programming problems / 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: Generalized intersection cuts and a new cut generating paradigm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing over the split closure / 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: Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs / 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: Heuristics for Multilevel Lot-Sizing with a Bottleneck / 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: Fenchel Cutting Planes for Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing deep facet-defining disjunctive cuts for mixed-integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local cuts for mixed-integer programming / 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: Numerically Safe Gomory Mixed-Integer Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Automatic Scaling of Matrices for Gaussian Elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: MIR closures of polyhedral sets / 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: Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing over the First Chvàtal Closure / 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: Deterministic Production Planning: Algorithms and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the exact separation of mixed integer knapsack cuts / 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: On disjunctive cuts for combinatorial optimization / 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 polyhedral structure of a multi-item production planning model 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: Lot-size models with backlogging: Strong reformulations and cutting planes / 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: Polyhedra for lot-sizing with Wagner-Whitin costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems / 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: 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: Relaxations for two-level multi-item lot-sizing problems / 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 / cites work
 
Property / cites work: A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands / rank
 
Normal rank

Latest revision as of 09:22, 13 July 2024

scientific article
Language Label Description Also known as
English
Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems
scientific article

    Statements

    Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 February 2017
    0 references
    lot-sizing
    0 references
    integer programming
    0 references
    local cuts
    0 references
    convex hull closure
    0 references
    quadratic programming
    0 references
    column generation
    0 references
    0 references

    Identifiers