The polytope of binary sequences with bounded variation

DOI10.1016/J.DISOPT.2023.100776MaRDI QIDQ6108928zbMATH OpenOpenAlexFDO

Authors Christoph Buchheim, Maja Hügging

Publication date 30 June 2023

Published in Discrete Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disopt.2023.100776

zbMATH Keywords

binary switchingextended formulationpolyhedral combinatoricstotal variation

Mathematics Subject Classification ID

Numerical methods of relaxation type (49M20) Production models (90B30) Mixed integer programming (90C11) Stochastic programming (90C15)

Recommendations

• Bounded variation in binary sequences
• The convex hull of a linear congruence relation in zero-one variables
• Parabolic optimal control problems with combinatorial switching constraints. I: Convex relaxations
• scientific article; zbMATH DE number 3843502
• Multilinear sets with two monomials and cardinality constraints

Cites work

• A polyhedral study of production ramping
• Bounded variation in binary sequences
• Min-up/min-down polytopes
• On mixed-integer optimal control with constrained total variation of the integer control
• Strong formulations for multistage stochastic self-scheduling unit commitment
• The min-up/min-down unit commitment polytope

Cited in

(6)

• Isoperimetric theorems in the binary sequences of finite lengths
• Bounded variation in binary sequences
• Parabolic optimal control problems with combinatorial switching constraints. I: Convex relaxations
• Parabolic optimal control problems with combinatorial switching constraints. II: Outer approximation algorithm
• Extended formulations for binary optimal control problems
• Parabolic optimal control problems with combinatorial switching constraints. III: Branch-and-bound algorithm

This page was built for publication: The polytope of binary sequences with bounded variation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6108928)