When is rounding allowed in integer nonlinear optimization?
From MaRDI portal
Publication:2514870
DOI10.1016/j.ejor.2014.01.059zbMath1304.90172OpenAlexW2060048272MaRDI QIDQ2514870
Publication date: 4 February 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2014.01.059
Related Items (6)
Multistage for identification of Wiener time delay systems based on hierarchical gradient approach ⋮ Convergence analysis of forgetting factor least squares algorithm for ARMAX time-delay models ⋮ Ellipsoid Bounds for Convex Quadratic Integer Programming ⋮ Time-delay Hammerstein system identification using modified cross-correlation method and variable stacking length multi-error algorithm ⋮ Time‐delay and parameter estimation for an ARX model based on copula theory and Armijo criterion and their applications in the modeling of the dynamics of the UAV ⋮ Extensions on ellipsoid bounds for quadratic integer programming
Uses Software
Cites Work
- Unnamed Item
- An effective branch-and-bound algorithm for convex quadratic integer programming
- Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes
- An algorithmic framework for convex mixed integer nonlinear programs
- \(N\)-fold integer programming
- On test sets for nonlinear integer maximization
- Absolute and monotonic norms
- Star-shaped sets in normed spaces
- The Cutting-Plane Method for Solving Convex Programs
- Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case
- Nonlinear Integer Programming
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- On the foundations of linear and integer linear programming I
- Integer Polynomial Optimization in Fixed Dimension
- Convex separable optimization is not much harder than linear optimization
This page was built for publication: When is rounding allowed in integer nonlinear optimization?
