Partial objective inequalities for the multi-item capacitated lot-sizing problem
type: Item
instance of: scholarly article
title: Partial objective inequalities for the multi-item capacitated lot-sizing problem
zbMATH Open document ID: 1391.90215
author: İ. Esra Büyüktahtakın
author: J. Cole Smith
author: Joseph C. Hartman
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6901554
zbMATH Keywords: mixed-integer programming
zbMATH Keywords: dynamic programming
zbMATH Keywords: cutting planes
zbMATH Keywords: valid inequalities
zbMATH Keywords: partial objective cuts
zbMATH Keywords: \((l, s)\) inequalities
zbMATH Keywords: polyhedral study
zbMATH Keywords: branch-and-cut
zbMATH Keywords: multi-item
zbMATH Keywords: capacitated lot-sizing
zbMATH Keywords: production planning
describes a project that uses: bc-prod
MaRDI profile type: Publication
full work available at URL: j.cor.2017.11.006
OpenAlex ID: W2769830667
cites work: Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems
cites work: A computational analysis of lower bounds for big bucket production planning problems
cites work: Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs
cites work: Multi-item lot-sizing with joint set-up costs
cites work: A study of the lot-sizing polytope
cites work: Facets of the knapsack polytope
cites work: Strong Formulations for Multi-Item Capacitated Lot Sizing
cites work: Uncapacitated lot-sizing: The convex hull of solutions
cites work: bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
cites work: Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs
cites work: Dynamic programming approximation algorithms for the capacitated lot-sizing problem
cites work: An Algorithm for Convex Polytopes
cites work: A cutting plane approach to capacitated lot-sizing with start-up costs
cites work: A polyhedral approach to a production planning problem
cites work: On Nonlinear Fractional Programming
cites work: Facets of the independent set polytope
cites work: Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
cites work: Deterministic Production Planning: Algorithms and Complexity
cites work: A horizon decomposition approach for the capacitated lot-sizing problem with setup times
cites work: Parametric approaches to fractional programs
cites work: Facets and algorithms for capacitated lot sizing
cites work: Dynamic knapsack sets and capacitated lot-sizing
cites work: Polyhedral Characterization of Discrete Dynamic Programming
cites work: A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case
cites work: On the polyhedral structure of a multi-item production planning model with setup times
cites work: Valid Linear Inequalities for Fixed Charge Problems
cites work: Valid inequalities and separation for capacitated economic lot sizing
cites work: Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes
cites work: Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
cites work: Production Planning by Mixed Integer Programming
cites work: Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms
cites work: Relaxations for two-level multi-item lot-sizing problems
cites work: Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution
cites work: A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands
DOI: 10.1016/J.COR.2017.11.006
description: scientific article; zbMATH DE number 6901554