Decomposition Branching for Mixed Integer Programming
Barış Yıldız, Natashia Boland, Martin Savelsbergh
págs. 1854-1872
Legal Assignments and Fast EADAM with Consent via Classic Theory of Stable Matchings
Yuri Faenza, Xuan Zhang
págs. 1873-1890
Subsampling to Enhance Efficiency in Input Uncertainty Quantification
Henry Lam, Huajie Qian
págs. 1891-1913
Using ℓ1-Relaxation and Integer Programming to Obtain Dual Bounds for Sparse PCA
Santanu S. Dey, Rahul Mazumder, Guanyi Wang
págs. 1914-1932
Dynamic Risked Equilibrium
Michael Ferris, Andy Philpott
págs. 1933-1952
© 2001-2024 Fundación Dialnet · Todos los derechos reservados
Coordinado por: