scientific article

zbMath1290.49002MaRDI QIDQ2873479

Michael N. Jung

Publication date: 24 January 2014

Full work available at URL: http://archiv.ub.uni-heidelberg.de/volltextserver/16036/1/DissertationJung.pdf

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

optimal controlnumerical examplesapproximationcutting planesrelaxationsmixed integer optimal controlBig-M-problemBoolean control functioninner and outer convexificationnonlinear branch-and-bound

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Duality theory (optimization) (49N15) Numerical methods of relaxation type (49M20) Research exposition (monographs, survey articles) pertaining to calculus of variations and optimal control (49-02)

Related Items (4)

On the time transformation of mixed integer optimal control problems using a consistent fixed integer control function ⋮ Parabolic optimal control problems with combinatorial switching constraints. I: Convex relaxations ⋮ Parabolic optimal control problems with combinatorial switching constraints. II: Outer approximation algorithm ⋮ Train timetabling for an urban rail transit line using a Lagrangian relaxation approach

This page was built for publication: