The Lagrangian relaxation for the combinatorial integral approximation problem

DOI10.1080/10556788.2014.890196zbMATH Open1325.49028OpenAlexW1987300367MaRDI QIDQ2943809FDOQ2943809

Authors: Michael Jung, Sebastian Sager, Gerhard Reinelt 

Publication date: 4 September 2015

Published in: Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2014.890196

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

zbMATH Keywords

integer programmingoptimal controlMILPLagrangian relaxationMIOCP

Mathematics Subject Classification ID

Mixed integer programming (90C11) Optimality conditions for problems involving relations other than differential equations (49K21) Decomposition methods (49M27)

Cites Work

• The Traveling-Salesman Problem and Minimum Spanning Trees
• The traveling-salesman problem and minimum spanning trees: Part II
• Transition-Time Optimization for Switched-Mode Dynamical Systems
• Direct methods with maximal lower bound for mixed-integer optimal control problems
• The integer approximation error in mixed-integer optimal control
• Min-up/min-down polytopes
• A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution.
• Time-optimal control of automobile test drives with gear shifts
• Combinatorial integral approximation
• An Application of Lagrangian Relaxation to Scheduling in Power-Generation Systems
• Branch and bound, integer, and non-integer programming

Cited In (25)

• Penalty alternating direction methods for mixed-integer optimal control with combinatorial constraints
• On convergence of binary trust-region steepest descent
• A partial outer convexification approach to control transmission lines
• Inversion of convection-diffusion equation with discrete sources
• A novel multidimensional penalty‐free approach for constrained optimal control of switched control systems
• A Lagrangian Relaxation for Golomb Rulers
• Computational approaches for mixed integer optimal control problems with indicator constraints
• A \(\frac{1}{2}\)-integral relaxation for the \(A\)-matching problem
• Multidimensional sum-up rounding for elliptic control systems
• Partial outer convexification for traffic light optimization in road networks
• Compactness and convergence rates in the combinatorial integral approximation decomposition
• Mixed-integer optimal control problems with switching costs: a shortest path approach
• A perspective-based convex relaxation for switched-affine optimal control
• A Simplified Newton Method to Generate Snapshots for POD Models of Semilinear Optimal Control Problems
• Parabolic optimal control problems with combinatorial switching constraints. I: Convex relaxations
• Parabolic optimal control problems with combinatorial switching constraints. II: Outer approximation algorithm
• Global optimization of mixed-integer ODE constrained network problems using the example of stationary gas transport
• Principles and Practice of Constraint Programming – CP 2004
• On mixed-integer optimal control with constrained total variation of the integer control
• Efficient upper and lower bounds for global mixed-integer optimal control
• Combinatorial integral approximation
• Decomposition and Approximation for PDE-Constrained Mixed-Integer Optimal Control
• Relaxed multibang regularization for the combinatorial integral approximation
• A Gauss-Newton-based decomposition algorithm for nonlinear mixed-integer optimal control problems
• Maximizing the storage capacity of gas networks: a global MINLP approach

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)