We have 2 of 17 papers
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
This paper proposes an exact parametric dynamic programming algorithm that achieves polynomial oracle complexity when the node cost functions belong to a fixed degree weak Chebyshev space, a broad functional class that includes piecewise polynomials.
A unified framework, based on decision diagrams, is proposed that serves both to solve the associated optimization problems and to construct ideal conic quadratic extended formulations of the closure of the convex hull of the underlying mixed-integer set.
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.
