The maximum 2D subarray polytope: facet-inducing inequalities and polyhedral computations

DOI10.1016/j.dam.2021.09.031OpenAlexW3208667120MaRDI QIDQ2091811

Javier Marenco, Ivo Koch

Publication date: 2 November 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2021.09.031

zbMATH Keywords

integer programmingfacetsmaximum subarray problem

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx) Computing methodologies and applications (68Uxx)

Uses Software

• PORTA

Cites Work

• Polytopes related to interval vectors and incidence matrices
• Complexities of efficient solutions of rectilinear polygon cover problems
• The 2D subarray polytope
• Covering rectilinear polygons with axis-parallel rectangles
• Unnamed Item

This page was built for publication: The maximum 2D subarray polytope: facet-inducing inequalities and polyhedral computations