An empirical evaluation of walk-and-round heuristics for mixed integer linear programs
From MaRDI portal
Publication:2393650
DOI10.1007/S10589-013-9540-0zbMATH Open1275.90045OpenAlexW2119069542MaRDI QIDQ2393650FDOQ2393650
Authors: Kuo-Ling Huang, Sanjay Mehrotra 
Publication date: 8 August 2013
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-013-9540-0
Recommendations
- An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs
- Rounding and propagation heuristics for mixed integer programming
- Heuristics for convex mixed integer nonlinear programs
- A dual heuristic for mixed integer programming
- Heuristic algorithms for the inverse mixed integer linear programming problem
- A hybrid primal heuristic for finding feasible solutions to mixed integer programs
- A feasibility pump heuristic for general mixed-integer problems
- Feasibility Pump-like heuristics for mixed integer problems
- Structure-driven fix-and-propagate heuristics for mixed integer programming
- Improving the performance of MIP and MINLP solvers by integrated heuristics
Approximation methods and heuristics in mathematical programming (90C59) Mixed integer programming (90C11)
Cites Work
- Octane: A New Heuristic for Pure 0–1 Programs
- On the Implementation of a Primal-Dual Interior Point Method
- Benchmarking optimization software with performance profiles.
- Convergence theorems for a class of simulated annealing algorithms on ℝd
- Feasibility pump 2.0
- Local branching
- A simplified homogeneous and self-dual linear programming algorithm and its implementation
- Hit-and-run mixes fast
- A feasibility pump heuristic for general mixed-integer problems
- Improving the feasibility pump
- Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm
- The feasibility pump
- Randomized interior point methods for sampling and optimization
- A mathematical view of interior-point methods in convex optimization
- Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
- Using the analytic center in the feasibility pump
- Title not available (Why is that?)
- Random walks on polytopes and an affine interior point method for linear programming
- Hit-and-Run from a Corner
- Solving convex programs by random walks
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Title not available (Why is that?)
- An evolutionary algorithm for polishing mixed integer programming solutions
- Title not available (Why is that?)
- Multiple centrality corrections in a primal-dual method for linear programming
- Title not available (Why is that?)
- Minimization by Random Search Techniques
- Computational experience with a modified potential reduction algorithm for linear programming
- Improving hit-and-run for global optimization
- Discrete hit-and-run for sampling points from arbitrary distributions over subsets of integer hyperrectangles
- Pivot and Complement–A Heuristic for 0-1 Programming
- Pivot and shift -- a mixed integer programming heuristic
- Solving symmetric indefinite systems in an interior-point method for linear programming
Cited In (6)
- Randomized interior point methods for sampling and optimization
- An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs
- Generation of feasible integer solutions on a massively parallel computer using the feasibility pump
- Sampling from the complement of a polyhedron: an MCMC algorithm for data augmentation
- Title not available (Why is that?)
- Feasibility pump algorithm for sparse representation under Laplacian noise
Uses Software
This page was built for publication: An empirical evaluation of walk-and-round heuristics for mixed integer linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2393650)
