Efficient Solution of Discrete Subproblems Arising in Integer Optimal Control with Total Variation Regularization

DOI10.1287/IJOC.2023.1294arXiv2206.01642OpenAlexW4361207183MaRDI QIDQ6200162

Unnamed Author, Paul Manns

Publication date: 22 March 2024

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2206.01642

zbMATH Keywords

integer programmingLagrangian relaxation\(A^*\) algorithminteger optimal controlresource-constrained shortest-path problems

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

This page was built for publication: Efficient Solution of Discrete Subproblems Arising in Integer Optimal Control with Total Variation Regularization