An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs
From MaRDI portal
Publication:2352416
DOI10.1007/s10589-014-9693-5zbMath1326.90055OpenAlexW2046640369MaRDI QIDQ2352416
Kuo-Ling Huang, Sanjay Mehrotra
Publication date: 1 July 2015
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-014-9693-5
Convex programming (90C25) Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Generation of feasible integer solutions on a massively parallel computer using the feasibility pump, Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Randomized interior point methods for sampling and optimization
- Recursive central rounding for mixed integer programs
- Using the analytic center in the feasibility pump
- Heuristics for convex mixed integer nonlinear programs
- An algorithmic framework for convex mixed integer nonlinear programs
- A feasibility pump for mixed integer nonlinear programs
- Feasibility pump 2.0
- A computational study of the homogeneous algorithm for large-scale convex optimization
- Local branching
- On a homogeneous algorithm for the monotone complementarity problem
- Exploring relaxation induced neighborhoods to improve MIP solutions
- A storm of feasibility pumps for nonconvex MINLP
- Hit-and-run mixes fast
- Improving hit-and-run for global optimization
- An empirical evaluation of walk-and-round heuristics for mixed integer linear programs
- A feasibility pump heuristic for general mixed-integer problems
- Improving the feasibility pump
- The feasibility pump
- Discrete Hit-and-Run for Sampling Points from Arbitrary Distributions Over Subsets of Integer Hyperrectangles
- Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
- Octane: A New Heuristic for Pure 0–1 Programs
- On the Implementation of a Primal-Dual Interior Point Method
- Random walks on polytopes and an affine interior point method for linear programming
- Computational experience with a modified potential reduction algorithm for linear programming
- Hit-and-Run from a Corner
- Solving convex programs by random walks
- Benchmarking optimization software with performance profiles.