Combinatorial integral approximation
DOI10.1007/s00186-011-0355-4zbMath1220.90073OpenAlexW2021848705WikidataQ59309669 ScholiaQ59309669MaRDI QIDQ634784
Christian Kirches, Sebastian Sager, Michael N. Jung
Publication date: 16 August 2011
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-011-0355-4
optimal controlinteger programmingmixed integer linear programming (MILP)mixed integer nonlinear programming (MINLP)mixed integer optimal control problem (MIOCP)
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30) Existence theories for optimal control problems involving ordinary differential equations (49J15)
Related Items (31)
Uses Software
Cites Work
- Unnamed Item
- Optimization models for operative planning in drinking water networks
- The integer approximation error in mixed-integer optimal control
- Third-order nilpotency, nice reachability and asymptotic stability
- An algorithmic framework for convex mixed integer nonlinear programs
- Certification of an optimal TSP tour through 85,900 cities
- A feasibility pump for mixed integer nonlinear programs
- Direct methods with maximal lower bound for mixed-integer optimal control problems
- Combinatorial optimization and small polytopes
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Min-up/min-down polytopes
- FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs
- Branching and bounds tighteningtechniques for non-convex MINLP
- A Counterexample to a Conjecture of Gurvits on Switched Systems
This page was built for publication: Combinatorial integral approximation