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
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
Cites Work
- scientific article; zbMATH DE number 1047679 (Why is no real title available?)
- scientific article; zbMATH DE number 1131479 (Why is no real title available?)
- scientific article; zbMATH DE number 1559589 (Why is no real title available?)
- scientific article; zbMATH DE number 3303655 (Why is no real title available?)
- A feasibility pump heuristic for general mixed-integer problems
- A mathematical view of interior-point methods in convex optimization
- A simplified homogeneous and self-dual linear programming algorithm and its implementation
- An evolutionary algorithm for polishing mixed integer programming solutions
- Benchmarking optimization software with performance profiles.
- Computational experience with a modified potential reduction algorithm for linear programming
- Convergence theorems for a class of simulated annealing algorithms on ℝd
- 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
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Feasibility pump 2.0
- Hit-and-Run from a Corner
- Hit-and-run mixes fast
- Improving hit-and-run for global optimization
- Improving the feasibility pump
- Local branching
- Minimization by Random Search Techniques
- Multiple centrality corrections in a primal-dual method for linear programming
- Octane: A New Heuristic for Pure 0–1 Programs
- On the Implementation of a Primal-Dual Interior Point Method
- Pivot and Complement–A Heuristic for 0-1 Programming
- Pivot and shift -- a mixed integer programming heuristic
- Random walks on polytopes and an affine interior point method for linear programming
- Randomized interior point methods for sampling and optimization
- Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm
- Solving convex programs by random walks
- Solving symmetric indefinite systems in an interior-point method for linear programming
- The feasibility pump
- Using the analytic center in the feasibility pump
Cited In (7)
- 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
- Improving the randomization step in feasibility pump
- Feasibility pump algorithm for sparse representation under Laplacian noise
- Fast MCMC sampling algorithms on polytopes
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)
