An exploratory computational analysis of dual degeneracy in mixed-integer programming
From MaRDI portal
Publication:2219511
DOI10.1007/s13675-020-00130-zzbMath1452.90220OpenAlexW3046911304MaRDI QIDQ2219511
Domenico Salvagnin, Timo Berthold, Gerald Gamrath
Publication date: 20 January 2021
Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13675-020-00130-z
Integer programming (90C10) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items
Uses Software
Cites Work
- Improving branch-and-cut performance by random sampling
- Three enhancements for optimization-based bound tightening
- Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. 6th international conference, CPAIOR 2009, Pittsburgh, PA, USA, May 27--31, 2009. Proceedings
- A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
- Branching rules revisited
- Global optimization problems and domain reduction strategies
- A first look at picking dual variables for maximizing reduced cost fixing
- Local rapid learning for integer programs
- MIPLIB 2003
- Evolution of Linear Programming Computing Techniques
- An Automatic Method of Solving Discrete Programming Problems
- Cloud Branching
- A tree-search algorithm for mixed integer programming problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item