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
-
Revisiting a Cutting-Plane Method for Perfect Matchings
by: Chen, Amber Q., et al.
Published: (2020-12-01) -
AC Optimal Power Flow: a Conic Programming relaxation and an iterative MILP scheme for Global Optimization
by: Oustry, Antoine
Published: (2022-11-01) -
Cost-Optimal Fuel Utilization, Genset Configuration and Battery Sizing: A Case-Study of a Norwegian Trawler
by: Tor Hennum, et al.
Published: (2024-10-01) -
Optimizing transient gas network control for challenging real-world instances using MIP-based heuristics
by: Hennings, Felix, et al.
Published: (2024-05-01) -
MILP Modeling and Optimization of Multi-Objective Three-Stage Flexible Job Shop Scheduling Problem With Assembly and AGV Transportation
by: Shiming Yang, et al.
Published: (2025-01-01)