Pub Date : 2018-12-17DOI: 10.1007/s12532-020-00199-y
R. Kannan, James R. Luedtke
{"title":"A stochastic approximation method for approximating the efficient frontier of chance-constrained nonlinear programs","authors":"R. Kannan, James R. Luedtke","doi":"10.1007/s12532-020-00199-y","DOIUrl":"https://doi.org/10.1007/s12532-020-00199-y","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"50 1","pages":"705 - 751"},"PeriodicalIF":6.3,"publicationDate":"2018-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90006973","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-11-02DOI: 10.1007/s12532-018-0151-8
Amin Dehghanian, Murat Kurt, A. Schaefer
{"title":"Optimizing over pure stationary equilibria in consensus stopping games","authors":"Amin Dehghanian, Murat Kurt, A. Schaefer","doi":"10.1007/s12532-018-0151-8","DOIUrl":"https://doi.org/10.1007/s12532-018-0151-8","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"87 1","pages":"341 - 380"},"PeriodicalIF":6.3,"publicationDate":"2018-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73403594","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-10-04DOI: 10.1007/s12532-018-0150-9
Burak Kocuk, Santanu S. Dey, X. A. Sun
{"title":"Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem","authors":"Burak Kocuk, Santanu S. Dey, X. A. Sun","doi":"10.1007/s12532-018-0150-9","DOIUrl":"https://doi.org/10.1007/s12532-018-0150-9","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"11 1","pages":"557 - 596"},"PeriodicalIF":6.3,"publicationDate":"2018-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72798133","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-09-27DOI: 10.1007/s12532-018-0149-2
Bin Yu, J. Mitchell, J. Pang
{"title":"Solving linear programs with complementarity constraints using branch-and-cut","authors":"Bin Yu, J. Mitchell, J. Pang","doi":"10.1007/s12532-018-0149-2","DOIUrl":"https://doi.org/10.1007/s12532-018-0149-2","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"174 1","pages":"267 - 310"},"PeriodicalIF":6.3,"publicationDate":"2018-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74872022","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-09-22DOI: 10.1007/s12532-018-0147-4
Fabio Furini, Emiliano Traversi, P. Belotti, A. Frangioni, A. Gleixner, Nick Gould, Leo Liberti, Andrea Lodi, R. Misener, H. Mittelmann, N. Sahinidis, Stefan Vigerske, Angelika Wiegele
{"title":"QPLIB: a library of quadratic programming instances","authors":"Fabio Furini, Emiliano Traversi, P. Belotti, A. Frangioni, A. Gleixner, Nick Gould, Leo Liberti, Andrea Lodi, R. Misener, H. Mittelmann, N. Sahinidis, Stefan Vigerske, Angelika Wiegele","doi":"10.1007/s12532-018-0147-4","DOIUrl":"https://doi.org/10.1007/s12532-018-0147-4","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"29 1","pages":"237 - 265"},"PeriodicalIF":6.3,"publicationDate":"2018-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91168902","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-09-20DOI: 10.1007/s12532-018-0148-3
D. E. Oliveira, Henry Wolkowicz, Yangyang Xu
{"title":"ADMM for the SDP relaxation of the QAP","authors":"D. E. Oliveira, Henry Wolkowicz, Yangyang Xu","doi":"10.1007/s12532-018-0148-3","DOIUrl":"https://doi.org/10.1007/s12532-018-0148-3","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"22 1","pages":"631 - 658"},"PeriodicalIF":6.3,"publicationDate":"2018-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81365709","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：