Granularity in nonlinear mixed-integer optimization
From MaRDI portal
Publication:2302751
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?
Cites work
- scientific article; zbMATH DE number 54095 (Why is no real title available?)
- scientific article; zbMATH DE number 3397605 (Why is no real title available?)
- A Representation and Economic Interpretation of a Two-Level Programming Problem
- A feasible rounding approach for mixed-integer optimization problems
- An algorithmic framework for convex mixed integer nonlinear programs
- Convex Analysis
- Derived eigenvalues of symmetric matrices, with applications to distance geometry
- Error bounds for mixed integer linear optimization problems
- Error bounds for mixed integer nonlinear optimization problems
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Feasibility pump 2.0
- Heuristics for convex mixed integer nonlinear programs
- How to solve a quadratic equation in integers
- Improving the feasibility pump
- Integer Programming
- Links between linear bilevel and mixed 0-1 programming problems
- MINLPLib -- a collection of test models for mixed-integer nonlinear programming
- Mixed-integer nonlinear optimization
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- RENS. The optimal rounding
- Some Feasibility Issues in Mathematical Programs with Equilibrium Constraints
- The feasibility pump
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP
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
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)
