An empirical evaluation of walk-and-round heuristics for mixed integer linear programs
From MaRDI portal
Publication:2393650
DOI10.1007/s10589-013-9540-0zbMath1275.90045OpenAlexW2119069542MaRDI QIDQ2393650
Sanjay Mehrotra, Kuo-Ling Huang
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
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Sampling from the complement of a polyhedron: an MCMC algorithm for data augmentation, Generation of feasible integer solutions on a massively parallel computer using the feasibility pump, Unnamed Item, Feasibility pump algorithm for sparse representation under Laplacian noise, An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs, Randomized interior point methods for sampling and optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Randomized interior point methods for sampling and optimization
- Using the analytic center in the feasibility pump
- Feasibility pump 2.0
- Solving symmetric indefinite systems in an interior-point method for linear programming
- Local branching
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Multiple centrality corrections in a primal-dual method for linear programming
- A simplified homogeneous and self-dual linear programming algorithm and its implementation
- Hit-and-run mixes fast
- Improving hit-and-run for global optimization
- Pivot and shift -- a mixed integer programming heuristic
- 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
- A Mathematical View of Interior-Point Methods in Convex Optimization
- An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions
- 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
- Pivot and Complement–A Heuristic for 0-1 Programming
- Minimization by Random Search Techniques
- On the Implementation of a Primal-Dual Interior Point Method
- Convergence theorems for a class of simulated annealing algorithms on ℝd
- 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.
