Recursive central rounding for mixed integer programs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1131479 (Why is no real title available?)
- A Nonlinear Analytic Center Cutting Plane Method for a Class of Convex Programming Problems
- A feasibility pump heuristic for general mixed-integer problems
- An interior point cutting plane heuristic for mixed integer programming
- Decomposition and Nondifferentiable Optimization with the Projective Algorithm
- Feasibility pump 2.0
- Heuristics of the branch-cut-and-price-framework SCIP
- Improving the feasibility pump
- Noncommercial software for mixed-integer linear programming
- The feasibility pump
- The submodular knapsack polytope
- Using the analytic center in the feasibility pump
- ZI round, a MIP rounding heuristic
Cited in
(12)- Aggregation and Mixed Integer Rounding to Solve MIPs
- Cutting plane selection with analytic centers and multiregression
- Feasible rounding approaches for equality constrained mixed-integer optimization problems
- Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs
- An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs
- ZI round, a MIP rounding heuristic
- A feasible rounding approach for mixed-integer optimization problems
- Improved branching disjunctions for branch-and-bound: an analytic center approach
- Feasible rounding based diving strategies in branch-and-bound methods for mixed-integer optimization
- Four Good Reasons to Use an Interior Point Solver Within a MIP Solver
- RENS. The optimal rounding
- Ten years of feasibility pump, and counting
This page was built for publication: Recursive central rounding for mixed integer programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336910)
