Mixed-integer optimal control problems with switching costs: a shortest path approach
DOI10.1007/s10107-020-01581-3zbMath1470.49004OpenAlexW3093730648MaRDI QIDQ2044973
Christoph Hansknecht, Paul Manns, Christian Kirches, Felix Bestehorn
Publication date: 11 August 2021
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-020-01581-3
Integer programming (90C10) Mixed integer programming (90C11) Nonlinear programming (90C30) Existence theories for optimal control problems involving ordinary differential equations (49J15) Decomposition methods (49M27) Graph theory (educational aspects) (97K30)
Related Items (4)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Relaxation methods for mixed-integer optimal control of partial differential equations
- The integer approximation error in mixed-integer optimal control
- SCIP: solving constraint integer programs
- On mixed-integer optimal control with constrained total variation of the integer control
- Multiphase mixed-integer nonlinear optimal control of hybrid electric vehicles
- Stirling’s Approximation for Central Extended Binomial Coefficients
- The Lagrangian relaxation for the combinatorial integral approximation problem
- MultiDimensional Sum-Up Rounding for Elliptic Control Systems
- Connection between ordinary multinomials, generalized Fibonacci numbers, partial Bell partition polynomials and convolution powers of discrete uniform distribution
- Improved regularity assumptions for partial outer convexification of mixed-integer PDE-constrained optimization problems
- Approximation Properties and Tight Bounds for Constrained Mixed-Integer Optimal Control
- Formal Power Series
This page was built for publication: Mixed-integer optimal control problems with switching costs: a shortest path approach