Learning a classification of mixed-integer quadratic programming problems
From MaRDI portal
Recommendations
- A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX
- Solving mixed integer classification problems by decomposition
- A comparison of a robust mixed-integer approach to existing methods for establishing classification rules for the discriminant problem
- Learning pseudo-backdoors for mixed integer programs
- Analyzing the computational impact of MIQCP solver components
Cited in
(30)- On the performance of linear programming heuristics applied on a quadratic transformation in the classification problem
- Theoretical challenges towards cutting-plane selection
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- Optimization problems for machine learning: a survey
- Data-driven algorithm selection and tuning in optimization and signal processing
- Learning pseudo-backdoors for mixed integer programs
- Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem
- Learning MILP resolution outcomes before reaching time-limit
- BDD-based optimization for the quadratic stable set problem
- Towards a machine learning-aided metaheuristic framework for a production/distribution system design problem
- Quadratic programming formulations for classificationand regression
- Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems
- Learning to Approximate Industrial Problems by Operations Research Classic Problems
- A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX
- Learning for Constrained Optimization: Identifying Optimal Active Constraint Sets
- Learning-based branch-and-price algorithms for the vehicle routing problem with time windows and two-dimensional loading constraints
- scientific article; zbMATH DE number 7400716 (Why is no real title available?)
- Daily scheduling of generating units with natural-gas market constraints
- Optimization with uncertainties: a scheduling example
- Towards Lower Bounds on the Depth of ReLU Neural Networks
- Machine learning augmented approaches for hub location problems
- A Prescriptive Machine Learning Approach to Mixed-Integer Convex Optimization
- Learning optimal solutions via an LSTM-optimization framework
- Mixed-integer quadratic programming reformulations of multi-task learning models
- Automatic MILP Solver configuration by learning problem similarities
- Learning and fine-tuning a generic value-selection heuristic inside a constraint programming solver
- Learning to branch: generalization guarantees and limits of data-independent discretization
- Artificial intelligence for optimization: unleashing the potential of parameter generation, model formulation, and solution methods
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
This page was built for publication: Learning a classification of mixed-integer quadratic programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1626794)
