Measuring the impact of primal heuristics
From MaRDI portal
Publication:2450740
DOI10.1016/j.orl.2013.08.007zbMath1287.90037OpenAlexW2008454042MaRDI QIDQ2450740
Publication date: 15 May 2014
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2013.08.007
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Improving branch-and-cut performance by random sampling, Adaptive large neighborhood search for mixed integer programming, Best practices for comparing optimization algorithms, Branch-and-cut for linear programs with overlapping SOS1 constraints, A robust and scalable algorithm for the Steiner problem in graphs, Solving MIPs via scaling-based augmentation, Adjusting the order crossover operator for capacitated vehicle routing problems, Online learning for scheduling MIP heuristics, Integer programming column generation: accelerating branch-and-price using a novel pricing scheme for finding high-quality solutions in set covering, packing, and partitioning problems, The vehicle routing problem with drones and drone speed selection, Exponential extrapolation memory for tabu search, The effect of different mathematical formulations on a matheuristic algorithm for the production routing problem, FiberSCIP—A Shared Memory Parallelization of SCIP, Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints, From feasibility to improvement to proof: three phases of solving mixed-integer programs, SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework, A massively parallel interior-point solver for LPs with generalized arrowhead structure, and applications to energy system models, Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs, A computational study of primal heuristics inside an MI(NL)P solver, Mixed-integer linear programming heuristics for the prepack optimization problem, PAVER 2.0: an open source environment for automated performance analysis of benchmarking data, Proximity search for 0--1 mixed-integer convex programming, Shift-and-propagate, Tailoring parallel alternating criteria search for domain specific MIPs: application to maritime inventory routing, Four Good Reasons to Use an Interior Point Solver Within a MIP Solver, Optimizing tactical harvest planning for multiple fruit orchards using a metaheuristic modeling approach, Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework, A computational status update for exact rational mixed integer programming, The confined primal integral: a measure to benchmark heuristic MINLP solvers against global MINLP solvers, Structure-driven fix-and-propagate heuristics for mixed integer programming, A computational status update for exact rational mixed integer programming, RENS. The optimal rounding, Unnamed Item, Conflict Analysis for MINLP, Conflict-Driven Heuristics for Mixed Integer Programming, Generalized relax-and-fix heuristic
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- SCIP: solving constraint integer programs
- Rounding-based heuristics for nonconvex MINLPS
- Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
- Reporting computational experiments in mathematical programming
- Solving Airline Crew Scheduling Problems by Branch-and-Cut
- Needed: An Empirical Science of Algorithms
- Feature Article—Toward an Experimental Method for Algorithm Simulation
- Computational Experience in Solving Linear Programs
- Benchmarking optimization software with performance profiles.
