![Closing the gap in linear bilevel optimization: a new valid primal-dual inequality | Optimization Letters Closing the gap in linear bilevel optimization: a new valid primal-dual inequality | Optimization Letters](https://media.springernature.com/lw685/springer-static/image/art%3A10.1007%2Fs11590-020-01660-6/MediaObjects/11590_2020_1660_Fig1_HTML.png)
Closing the gap in linear bilevel optimization: a new valid primal-dual inequality | Optimization Letters
GitHub - Sheng-Cheng/QC2QP-SDR-Optimality-Gap-Test: Optimality gap test of a quadratic program with two quadratic constraints (QC2QP)
Improving Optimization Bounds Using Machine Learning: Decision Diagrams Meet Deep Reinforcement Learning
![AI | Free Full-Text | A Study of Learning Search Approximation in Mixed Integer Branch and Bound: Node Selection in SCIP AI | Free Full-Text | A Study of Learning Search Approximation in Mixed Integer Branch and Bound: Node Selection in SCIP](https://www.mdpi.com/ai/ai-02-00010/article_deploy/html/images/ai-02-00010-g008.png)
AI | Free Full-Text | A Study of Learning Search Approximation in Mixed Integer Branch and Bound: Node Selection in SCIP
![An Optimality Gap Test for a Semidefinite Relaxation of a Quadratic Program with Two Quadratic Constraints | Papers With Code An Optimality Gap Test for a Semidefinite Relaxation of a Quadratic Program with Two Quadratic Constraints | Papers With Code](https://raw.githubusercontent.com/Sheng-Cheng/QC2QP-SDR-Optimality-Gap-Test/master/images/MATLAB%20output%20message.png)
An Optimality Gap Test for a Semidefinite Relaxation of a Quadratic Program with Two Quadratic Constraints | Papers With Code
![EVALUATING THE 'OPTIMALITY GAP' BETWEEN CYCLIC AND NON-CYCLIC PLANNING POLICIES IN SUPPLY CHAINS | Semantic Scholar EVALUATING THE 'OPTIMALITY GAP' BETWEEN CYCLIC AND NON-CYCLIC PLANNING POLICIES IN SUPPLY CHAINS | Semantic Scholar](https://d3i71xaburhd42.cloudfront.net/6a70e43fcd5622c7d4ab33de55cc4ba237ffc899/3-Figure1-1.png)
EVALUATING THE 'OPTIMALITY GAP' BETWEEN CYCLIC AND NON-CYCLIC PLANNING POLICIES IN SUPPLY CHAINS | Semantic Scholar
![Mixed-integer programming approaches for the time-constrained maximal covering routing problem | OR Spectrum Mixed-integer programming approaches for the time-constrained maximal covering routing problem | OR Spectrum](https://media.springernature.com/lw685/springer-static/image/art%3A10.1007%2Fs00291-021-00635-y/MediaObjects/291_2021_635_Fig7_HTML.png)