One-shot learning for MIPs with SOS1 constraints
type: Item
instance of: scholarly article
title: One-shot learning for MIPs with SOS1 constraints
author: Q5884392
author: Jean-François Cordeau
author: Emma Frejinger
published in: SN Operations Research Forum
publication date: 2024-07-25T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7887249
zbMATH Keywords: machine learning
zbMATH Keywords: mixed integer programming
zbMATH Keywords: learning heuristics
zbMATH Keywords: fleet management problem
MaRDI profile type: MaRDI publication profile
cites work: Generalization of machine learning for problem reduction: a case study on travelling salesman problems
cites work: Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems
cites work: Deep learning with long short-term memory networks for financial market predictions
cites work: Machine learning for combinatorial optimization: a methodological tour d'horizon
cites work: On learning and branching: a survey
cites work: Exploring relaxation induced neighborhoods to improve MIP solutions
cites work: RENS. The optimal rounding
cites work: Integer Programming
cites work: Enabling research through the SCIP Optimization Suite 8.0
cites work: An Automatic Method of Solving Discrete Programming Problems
cites work: Mathematical programming based heuristics for the 0--1 MIP: a survey
cites work: The feasibility pump
cites work: A feasibility pump heuristic for general mixed-integer problems
cites work: Improving the feasibility pump
cites work: Local branching
cites work: Proximity search for 0--1 mixed-integer convex programming
cites work: Adaptive large neighborhood search for mixed integer programming
cites work: Rounding and Propagation Heuristics for Mixed Integer Programming
cites work: A feasible rounding approach for mixed-integer optimization problems
cites work: ZI round, a MIP rounding heuristic
cites work: Information-theoretic approaches to branching in search
cites work: Information-based branching schemes for binary linear mixed integer problems
cites work: A Mathematical Theory of Communication
cites work: Rapid Learning for Binary Programs
cites work: Local rapid learning for integer programs
cites work: Graph Representation Learning
cites work: Deep learning assisted heuristic tree search for the container pre-marshalling problem
cites work: MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
cites work: JuMP 1.0: recent improvements to a modeling language for mathematical optimization
cites work: Algorithm Selection for Combinatorial Search Problems: A Survey
DOI: 10.1007/S43069-024-00336-6
description: scientific article; zbMATH DE number 7887249