<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2012-07-25 10:25:04Operations research Combinatorial optimization Travelling salesman problem Branch and bound Linear programming relaxation Integer programming Branch and cut Linear programming Algorithm Mathematical optimization Cutting-plane method Simplex algorithm |
Add to Reading List |
227 Documenta Math. Markowitz and Manne + Eastman + Land and Doig = Branch and Bound![arXiv:1807.01672v2 [cs.LG] 6 JulRanked Reward: Enabling Self-Play Reinforcement Learning for Combinatorial Optimization Alexandre Laterre](https://www.pdfsearch.io/img/fc82b7913ca0093fe7c1f22778317c8f.jpg "arXiv:1807.01672v2 [cs.LG] 6 JulRanked Reward: Enabling Self-Play Reinforcement Learning for Combinatorial Optimization Alexandre Laterre")
![Research Summary∗ Chandra Nair Overview In my early research career I considered random versions of combinatorial optimization problems; my doctoral thesis [17] resolved a long-standing conjecture about the assignment](https://www.pdfsearch.io/img/869aefdb3eda27cbac49899f24e2c699.jpg "Research Summary∗ Chandra Nair Overview In my early research career I considered random versions of combinatorial optimization problems; my doctoral thesis [17] resolved a long-standing conjecture about the assignment")
