DASH: dynamic approach for switching heuristics
From MaRDI portal
Publication:320816
DOI10.1016/j.ejor.2015.08.018zbMath1346.90629arXiv1307.4689OpenAlexW2151159522MaRDI QIDQ320816
Kevin Leo, Giovanni Di Liberto, Serdar Kadioglu, Yuri Malitsky
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.4689
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (5)
Multivariable Branching: A 0-1 Knapsack Problem Case Study ⋮ On learning and branching: a survey ⋮ \textsc{Ner4Opt}: named entity recognition for optimization modelling from natural language ⋮ Machine learning for combinatorial optimization: a methodological tour d'horizon ⋮ Deep learning assisted heuristic tree search for the container pre-marshalling problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Learning dynamic algorithm portfolios
- Active-constraint variable ordering for faster feasibility of mixed integer linear programs
- On the facets of the mixed-integer knapsack polyhedron
- A study of the lot-sizing polytope
- Branching rules revisited
- Backdoor Branching
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Heuristics for dynamically adapting propagation in constraint satisfaction problems
- A Computational Study of Search Strategies for Mixed Integer Programming
- The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
- Production Planning by Mixed Integer Programming
- Branch-and-Bound Methods: General Formulation and Properties
- Learning Value Heuristics for Constraint Programming
- Algorithm portfolios
- Flow pack facets of the single node fixed-charge flow polytope
- Valid inequalities for problems with additive variable upper bounds
This page was built for publication: DASH: dynamic approach for switching heuristics
