Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2601.20977 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918316920012800 |
|---|---|
| author | Yamagishi, Paulo Michel F. Fampa, Marcia Lee, Jon |
| author_facet | Yamagishi, Paulo Michel F. Fampa, Marcia Lee, Jon |
| contents | We introduce the dual-path fixing strategy to exploit dual algorithms for solving relaxations of mixed-integer nonlinear-optimization problems. Such dual algorithms are naturally applied in the context of branch-and-bound, and eventual impact on the success of branch-and-bound is our strong motivation. Our fixing strategy aims to be more powerful than the common strategy of fixing variables based on a single dual-feasible solution (e.g., standard reduced-cost fixing for mixed-integer linear optimization), but to be much faster than ``strong fixing'', essentially requiring no more time than that of the dual algorithm that we exploit. We have successfully tested our ideas on mixed-integer linear-optimization set-covering instances from the literature, in the context of the dual-simplex method applied to the continuous relaxations. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_20977 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | The dual-path fixing strategy and its application to the set-covering problem Yamagishi, Paulo Michel F. Fampa, Marcia Lee, Jon Optimization and Control We introduce the dual-path fixing strategy to exploit dual algorithms for solving relaxations of mixed-integer nonlinear-optimization problems. Such dual algorithms are naturally applied in the context of branch-and-bound, and eventual impact on the success of branch-and-bound is our strong motivation. Our fixing strategy aims to be more powerful than the common strategy of fixing variables based on a single dual-feasible solution (e.g., standard reduced-cost fixing for mixed-integer linear optimization), but to be much faster than ``strong fixing'', essentially requiring no more time than that of the dual algorithm that we exploit. We have successfully tested our ideas on mixed-integer linear-optimization set-covering instances from the literature, in the context of the dual-simplex method applied to the continuous relaxations. |
| title | The dual-path fixing strategy and its application to the set-covering problem |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2601.20977 |