Towards an unsupervised learning scheme for efficiently solving parameterized mixed-integer programs
From MaRDI portal
Cites work
- A branch-and-bound algorithm with growing datasets for large-scale parameter estimation
- A mixed integer linear programming model for multi-sector planning using speed and heading changes
- A novel mixed-integer linear programming formulation for continuous-time inventory routing
- Cutting Planes from the Branch-and-Bound Tree: Challenges and Opportunities
- Decomposition techniques in mathematical programming. Engineering and science applications.
- Learning for Constrained Optimization: Identifying Optimal Active Constraint Sets
- Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- Mixed integer programming models for job shop scheduling: A computational analysis
- Optimal classification trees
- Reducing the Dimensionality of Data with Neural Networks
- Scheduling in supply chains using mixed integer programming
- Scikit-learn: machine learning in Python
- The voice of optimization
- Valid inequalities for mixed integer linear programs
This page was built for publication: Towards an unsupervised learning scheme for efficiently solving parameterized mixed-integer programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6861973)