The mixing set with divisible capacities: a simple approach
type: Item
instance of: scholarly article
title: The mixing set with divisible capacities: a simple approach
zbMATH Open document ID: 1180.90184
author: Michele Conforti
author: Giacomo Zambelli
published in: Operations Research Letters
publication date: 2009-12-07T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 5643623
zbMATH Keywords: mixing set
zbMATH Keywords: unimodular transformations
zbMATH Keywords: dynamic programming
zbMATH Keywords: extended formulations
MaRDI profile type: Publication
full work available at URL: j.orl.2009.07.001
OpenAlex ID: W2154859257
cites work: Production Planning by Mixed Integer Programming
cites work: New Hardness Results for Diophantine Approximation
cites work: Mixing mixed-integer inequalities
cites work: Tight formulations for some simple mixed integer programs and convex objective integer programs
cites work: The mixing-MIR set with divisible capacities
cites work: The Mixing Set with Divisible Capacities
cites work: Q3818127
cites work: Polyhedral Characterization of Discrete Dynamic Programming
cites work: Extended Formulations for Packing and Partitioning Orbitopes
cites work: A solution approach of production planning problems based on compact formulations for single-item lot-sizing models. (Abstract of thesis)
DOI: 10.1016/J.ORL.2009.07.001
description: scientific article; zbMATH DE number 5643623