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
-
A reliable mixed-integer linear programming formulation for data-driven model predictive control in buildings
by: Peter Klanatsky, et al.
Published: (2025-12-01) -
A Dynamic Multi-Period, Mixed-Integer Linear Programming Model for Cost Minimization of a Three-Echelon, Multi-Site and Multi-Product Construction Supply Chain
by: Aspasia Koutsokosta, et al.
Published: (2020-08-01) -
Studies in integer programming /
Published: (1977) -
Optimization of Broiler Chicken Harvest Scheduling using Integer Linear Programming: A Case Study
by: Danang Setiawan, et al.
Published: (2025-06-01) -
Revisiting a Cutting-Plane Method for Perfect Matchings
by: Chen, Amber Q., et al.
Published: (2020-12-01)