The Lagrangian relaxation for the combinatorial integral approximation problem
From MaRDI portal
Recommendations
- Semidefinite and Lagrangian relaxations for hard combinatorial problems
- Lagrangian relaxation for integer programming
- scientific article; zbMATH DE number 3614502
- scientific article; zbMATH DE number 3858858
- Improved Approximation Schemes for Linear Programming Relaxations of Combinatorial Optimization Problems
- Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems
- Relaxed inexact algorithm for continuous complementarity problems on measure spaces
- Lagrangian relaxation and partial cover (Extended abstract)
- scientific article; zbMATH DE number 4197745
- On Lagrangian Relaxation and Subset Selection Problems
Cites work
- A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution.
- An Application of Lagrangian Relaxation to Scheduling in Power-Generation Systems
- Branch and bound, integer, and non-integer programming
- Combinatorial integral approximation
- Direct methods with maximal lower bound for mixed-integer optimal control problems
- Min-up/min-down polytopes
- The integer approximation error in mixed-integer optimal control
- The Traveling-Salesman Problem and Minimum Spanning Trees
- The traveling-salesman problem and minimum spanning trees: Part II
- Time-optimal control of automobile test drives with gear shifts
- Transition-Time Optimization for Switched-Mode Dynamical Systems
Cited in
(27)- Computational approaches for mixed integer optimal control problems with indicator constraints
- On mixed-integer optimal control with constrained total variation of the integer control
- 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
- Inversion of convection-diffusion equation with discrete sources
- Maximizing the storage capacity of gas networks: a global MINLP approach
- Efficient upper and lower bounds for global mixed-integer optimal control
- A partial outer convexification approach to control transmission lines
- A \(\frac{1}{2}\)-integral relaxation for the \(A\)-matching problem
- Partial outer convexification for traffic light optimization in road networks
- Multidimensional sum-up rounding for elliptic control systems
- A Lagrangian Relaxation for Golomb Rulers
- Relaxed multibang regularization for the combinatorial integral approximation
- 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
- Global optimization of mixed-integer ODE constrained network problems using the example of stationary gas transport
- Principles and Practice of Constraint Programming – CP 2004
- A novel multidimensional penalty‐free approach for constrained optimal control of switched control systems
- A Gauss-Newton-based decomposition algorithm for nonlinear mixed-integer optimal control problems
- Combinatorial integral approximation
- Parabolic optimal control problems with combinatorial switching constraints. I: Convex relaxations
- Parabolic optimal control problems with combinatorial switching constraints. II: Outer approximation algorithm
- On convergence of binary trust-region steepest descent
- Parabolic optimal control problems with combinatorial switching constraints. III: Branch-and-bound algorithm
- A numerical study of transformed mixed-integer optimal control problems
- A perspective-based convex relaxation for switched-affine optimal control
This page was built for publication: The Lagrangian relaxation for the combinatorial integral approximation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2943809)
