Pages that link to "Item:Q2408515"
From MaRDI portal
The following pages link to On learning and branching: a survey (Q2408515):
Displaying 33 items.
- An enhanced logical benders approach for linear programs with complementarity constraints (Q785626) (← links)
- Mathematical optimization in classification and regression trees (Q828748) (← links)
- An intelligent algorithm for mixed-integer programming models (Q1206379) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- Machine learning meets mathematical optimization to predict the optimal production of offshore wind parks (Q1734857) (← links)
- Machine learning for combinatorial optimization: a methodological tour d'horizon (Q2029358) (← links)
- Optimization problems for machine learning: a survey (Q2029894) (← links)
- Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems (Q2140266) (← links)
- Hybrid offline/online optimization for energy management via reinforcement learning (Q2170215) (← links)
- Learning to steer nonlinear interior-point methods (Q2175369) (← links)
- Predicting solutions of large-scale optimization problems via machine learning: a case study in blood supply chain management (Q2177838) (← links)
- Deep learning assisted heuristic tree search for the container pre-marshalling problem (Q2333140) (← links)
- Computational study of a branching algorithm for the maximum \(k\)-cut problem (Q2673248) (← links)
- Computational advances in polynomial optimization: RAPOSa, a freely available global solver (Q2689854) (← links)
- Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems (Q4995099) (← links)
- Improving Variable Orderings of Approximate Decision Diagrams Using Reinforcement Learning (Q5058000) (← links)
- A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX (Q5060504) (← links)
- Multivariable Branching: A 0-1 Knapsack Problem Case Study (Q5084602) (← links)
- Predicting Tactical Solutions to Operational Planning Problems Under Imperfect Information (Q5084648) (← links)
- Decomposition Branching for Mixed Integer Programming (Q5095180) (← links)
- Online Mixed-Integer Optimization in Milliseconds (Q5106419) (← links)
- ReLU neural networks of polynomial size for exact maximum flow computation (Q6086001) (← links)
- Towards Lower Bounds on the Depth of ReLU Neural Networks (Q6100606) (← links)
- A machine learning optimization approach for last-mile delivery and third-party logistics (Q6106567) (← links)
- Adaptive solution prediction for combinatorial optimization (Q6112875) (← links)
- A theoretical and computational analysis of full strong-branching (Q6126652) (← links)
- Learning optimal solutions via an LSTM-optimization framework (Q6168346) (← links)
- A branch and bound algorithm for robust binary optimization with budget uncertainty (Q6175705) (← links)
- Learning to sample initial solution for solving 0-1 discrete optimization problem by local search (Q6564766) (← links)
- One-shot learning for MIPs with SOS1 constraints (Q6579097) (← links)
- Guest editorial to the special issue on machine learning and mathematical optimization in top-transactions in operations research (Q6635844) (← links)
- Crew recovery optimization with deep learning and column generation for sustainable airline operation management (Q6658347) (← links)
- Polynomial optimization: tightening RLT-based branch-and-bound schemes with conic constraints (Q6661703) (← links)
