Adaptive Cut Selection in Mixed-Integer Linear Programming
Cutting plane selection is a subroutine used in all modern mixed-integer linear programming solvers with the goal of selecting a subset of generated cuts that induce optimal solver performance. These solvers have millions of parameter combinations, and so are excellent candidates for parameter tunin...
Saved in:
Main Authors: | Turner, Mark, Koch, Thorsten, Serrano, Felipe, Winkler, Michael |
---|---|
Format: | Article |
Language: | English |
Published: |
Université de Montpellier
2023-07-01
|
Series: | Open Journal of Mathematical Optimization |
Subjects: | |
Online Access: | https://ojmo.centre-mersenne.org/articles/10.5802/ojmo.25/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Optimizing Supply Chain Inventory: A Mixed Integer Linear Programming Approach
by: Joaquim Jorge Vicente
Published: (2025-01-01) -
Revisiting a Cutting-Plane Method for Perfect Matchings
by: Chen, Amber Q., et al.
Published: (2020-12-01) -
Optimizing the Supply Chain for Recycling Electric Vehicle NMC Batteries
by: Fransisca Indraningsih Kasy, et al.
Published: (2025-01-01) -
Bi-level data-driven enterprise-wide optimization with mixed-integer nonlinear scheduling problems
by: Hasan Nikkhah, et al.
Published: (2025-03-01) -
Solving the fully fuzzy multi-choice linear programming model
by: Zahra Arami, et al.
Published: (2024-08-01)