The Lagrangian relaxation for the combinatorial integral approximation problem
From MaRDI portal
Publication:2943809
DOI10.1080/10556788.2014.890196zbMath1325.49028OpenAlexW1987300367MaRDI QIDQ2943809
Sebastian Sager, Michael N. Jung, Gerhard Reinelt
Publication date: 4 September 2015
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2014.890196
Mixed integer programming (90C11) Decomposition methods (49M27) Optimality conditions for problems involving relations other than differential equations (49K21)
Related Items
Inversion of convection-diffusion equation with discrete sources, A Simplified Newton Method to Generate Snapshots for POD Models of Semilinear Optimal Control Problems, Decomposition and Approximation for PDE-Constrained Mixed-Integer Optimal Control, Computational approaches for mixed integer optimal control problems with indicator constraints, A partial outer convexification approach to control transmission lines, A novel multidimensional penalty‐free approach for constrained optimal control of switched control systems, A perspective-based convex relaxation for switched-affine optimal control, A Gauss-Newton-based decomposition algorithm for nonlinear mixed-integer optimal control problems, Partial Outer Convexification for Traffic Light Optimization in Road Networks, On mixed-integer optimal control with constrained total variation of the integer control, Global Optimization of Mixed-Integer ODE Constrained Network Problems Using the Example of Stationary Gas Transport, Compactness and convergence rates in the combinatorial integral approximation decomposition, Penalty alternating direction methods for mixed-integer optimal control with combinatorial constraints, Mixed-integer optimal control problems with switching costs: a shortest path approach, MultiDimensional Sum-Up Rounding for Elliptic Control Systems, Maximizing the storage capacity of gas networks: a global MINLP approach, Relaxed Multibang Regularization for the Combinatorial Integral Approximation, Efficient upper and lower bounds for global mixed-integer optimal control
Cites Work
- The integer approximation error in mixed-integer optimal control
- Branch and bound, integer, and non-integer programming
- Combinatorial integral approximation
- Direct methods with maximal lower bound for mixed-integer optimal control problems
- A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution.
- Min-up/min-down polytopes
- Time-optimal control of automobile test drives with gear shifts
- An Application of Lagrangian Relaxation to Scheduling in Power-Generation Systems
- Transition-Time Optimization for Switched-Mode Dynamical Systems
- The Traveling-Salesman Problem and Minimum Spanning Trees
- The traveling-salesman problem and minimum spanning trees: Part II
