A feasible rounding approach for mixed-integer optimization problems
From MaRDI portal
Recommendations
- Feasible rounding approaches for equality constrained mixed-integer optimization problems
- Rounding and propagation heuristics for mixed integer programming
- A rounding algorithm for integer programs
- Feasible rounding based diving strategies in branch-and-bound methods for mixed-integer optimization
- Recursive central rounding for mixed integer programs
- Analysis of randomised rounding for integer programs
- A rounding procedure for semidefinite optimization
- A simple rounding scheme for multistage optimization
- scientific article; zbMATH DE number 3972639
- scientific article; zbMATH DE number 1873261
Cites work
- A feasibility pump heuristic for general mixed-integer problems
- Boosting the feasibility pump
- Efficient Heuristic Procedures for Integer Linear Programming with an Interior
- Error bounds for mixed integer linear optimization problems
- Error bounds for mixed integer nonlinear optimization problems
- Feasibility pump 2.0
- Granularity in nonlinear mixed-integer optimization
- Heuristics for convex mixed integer nonlinear programs
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- Improving the feasibility pump
- Integer Programming
- Integer Rounding for Polymatroid and Branching Optimization Problems
- MIPLIB 2003
- Mixed-integer nonlinear optimization
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
- Presolve Reductions in Mixed Integer Programming
- RENS. The optimal rounding
- Rounding-based heuristics for nonconvex MINLPS
- The feasibility pump
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP
Cited in
(14)- Bounds on the objective value of feasible roundings
- Granularity in nonlinear mixed-integer optimization
- When is rounding allowed in integer nonlinear optimization?
- Error bounds for mixed integer linear optimization problems
- Recursive central rounding for mixed integer programs
- Aggregation and Mixed Integer Rounding to Solve MIPs
- Radius of Robust Feasibility for Mixed-Integer Problems
- Generating feasible points for mixed-integer convex optimization problems by inner parallel cuts
- Feasible rounding approaches for equality constrained mixed-integer optimization problems
- Feasible rounding based diving strategies in branch-and-bound methods for mixed-integer optimization
- One-shot learning for MIPs with SOS1 constraints
- A solver for multiobjective mixed-integer convex and nonconvex optimization
- Granularity for mixed-integer polynomial optimization problems
- Infeasible/feasible search trajectories and directional rounding in integer programming
This page was built for publication: A feasible rounding approach for mixed-integer optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2419508)
