Granularity in nonlinear mixed-integer optimization
DOI10.1007/S10957-019-01591-YzbMATH Open1433.90089OpenAlexW2977396163WikidataQ127172625 ScholiaQ127172625MaRDI QIDQ2302751FDOQ2302751
Authors: Christoph Neumann, Oliver Stein, Nathan Sudermann-Merx 
Publication date: 26 February 2020
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-019-01591-y
Recommendations
- A feasible rounding approach for mixed-integer optimization problems
- Bounds on the objective value of feasible roundings
- Error bounds for mixed integer nonlinear optimization problems
- Error bounds for mixed integer linear optimization problems
- When is rounding allowed in integer nonlinear optimization?
Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Integer programming (90C10) Mixed integer programming (90C11)
Cites Work
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- MINLPLib -- a collection of test models for mixed-integer nonlinear programming
- Mixed-integer nonlinear optimization
- Convex Analysis
- An algorithmic framework for convex mixed integer nonlinear programs
- Feasibility pump 2.0
- Links between linear bilevel and mixed 0-1 programming problems
- Improving the feasibility pump
- The feasibility pump
- Error bounds for mixed integer linear optimization problems
- A Representation and Economic Interpretation of a Two-Level Programming Problem
- Heuristics for convex mixed integer nonlinear programs
- Derived eigenvalues of symmetric matrices, with applications to distance geometry
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Title not available (Why is that?)
- Error bounds for mixed integer nonlinear optimization problems
- Title not available (Why is that?)
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP
- RENS. The optimal rounding
- How to solve a quadratic equation in integers
- Some Feasibility Issues in Mathematical Programs with Equilibrium Constraints
- Integer Programming
- A feasible rounding approach for mixed-integer optimization problems
Cited In (6)
- A feasible rounding approach for mixed-integer optimization problems
- Bounds on the objective value of feasible roundings
- Feasible rounding approaches for equality constrained mixed-integer optimization problems
- Feasible rounding based diving strategies in branch-and-bound methods for mixed-integer optimization
- A solver for multiobjective mixed-integer convex and nonconvex optimization
- Generating feasible points for mixed-integer convex optimization problems by inner parallel cuts
Uses Software
This page was built for publication: Granularity in nonlinear mixed-integer optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2302751)
