The mixing set with divisible capacities: A simple approach

Authors:
Michele Conforti;Giacomo Zambelli
Affiliations:
Dipartimento di Matematica Pura e Applicata, Universitá di Padova, Via Trieste 63, 35121 Padova, Italy;Dipartimento di Matematica Pura e Applicata, Universitá di Padova, Via Trieste 63, 35121 Padova, Italy
Venue:
Operations Research Letters
Year:
2009

Citing 6
Cited 1

Theory of linear and integer programming

Theory of linear and integer programming
Polyhedral characterization of discrete dynamic programming

Operations Research
Production Planning by Mixed Integer Programming (Springer Series in Operations Research and Financial Engineering)

Production Planning by Mixed Integer Programming (Springer Series in Operations Research and Financial Engineering)
The mixing-MIR set with divisible capacities

Mathematical Programming: Series A and B
Extended Formulations for Packing and Partitioning Orbitopes

Mathematics of Operations Research
The mixing set with divisible capacities

IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization

Strong formulations for the multi-module PESP and a quadratic algorithm for graphical diophantine equation systems

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a simple algorithm for linear optimization over the mixing set with divisible capacities, and derive a compact extended formulation from such an algorithm. The main idea is to apply a suitable unimodular transformation to obtain an equivalent problem that is easier to analyze.