Open J. Math. Optim.最新文献_第2页

The difference vectors for convex sets and a resolution of the geometry conjecture 凸集的差分向量和几何猜想的解析

Open J. Math. Optim. Pub Date : 2020-12-08 DOI: 10.5802/ojmo.7

S. Alwadani, Heinz H. Bauschke, J. Revalski, Xianfu Wang

引用次数: 8

Non-Convex Split Feasibility Problems: Models, Algorithms and Theory 非凸分裂可行性问题:模型、算法和理论

Open J. Math. Optim. Pub Date : 2020-10-09 DOI: 10.5802/ojmo.1

A. Gibali, Shoham Sabach, Sergey Voldman

引用次数: 5

Robust Combinatorial Optimization with Locally Budgeted Uncertainty 具有局部预算不确定性的鲁棒组合优化

Open J. Math. Optim. Pub Date : 2020-08-27 DOI: 10.5802/ojmo.5

M. Goerigk, Stefan Lendl

{"title":"Robust Combinatorial Optimization with Locally Budgeted Uncertainty","authors":"M. Goerigk, Stefan Lendl","doi":"10.5802/ojmo.5","DOIUrl":"https://doi.org/10.5802/ojmo.5","url":null,"abstract":"Budgeted uncertainty sets have been established as a major influence on uncertainty modeling for robust optimization problems. A drawback of such sets is that the budget constraint only restricts the global amount of cost increase that can be distributed by an adversary. Local restrictions, while being important for many applications, cannot be modeled this way. \u0000We introduce new variant of budgeted uncertainty sets, called locally budgeted uncertainty. In this setting, the uncertain parameters become partitioned, such that a classic budgeted uncertainty set applies to each partition, called region. \u0000In a theoretical analysis, we show that the robust counterpart of such problems for a constant number of regions remains solvable in polynomial time, if the underlying nominal problem can be solved in polynomial time as well. If the number of regions is unbounded, we show that the robust selection problem remains solvable in polynomial time, while also providing hardness results for other combinatorial problems. \u0000In computational experiments using both random and real-world data, we show that using locally budgeted uncertainty sets can have considerable advantages over classic budgeted uncertainty sets.","PeriodicalId":186223,"journal":{"name":"Open J. Math. Optim.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126940495","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 6

Cycle-based formulations in Distance Geometry 距离几何中基于循环的公式

Open J. Math. Optim. Pub Date : 2020-06-20 DOI: 10.5802/ojmo.18

Leo Liberti, Gabriele Iommazzo, C. Lavor, N. Maculan

引用次数: 0

The Referenced Vertex Ordering Problem: Theory, Applications, and Solution Methods 参考顶点排序问题:理论、应用和解决方法

Open J. Math. Optim. Pub Date : 2020-03-16 DOI: 10.5802/ojmo.8

J. Omer, A. Mucherino

{"title":"The Referenced Vertex Ordering Problem: Theory, Applications, and Solution Methods","authors":"J. Omer, A. Mucherino","doi":"10.5802/ojmo.8","DOIUrl":"https://doi.org/10.5802/ojmo.8","url":null,"abstract":"We introduce the referenced vertex ordering problem (REVORDER) as a combinatorial decision problem generalizing several vertex ordering problems that already appeared in the scientific literature under different guises. In other words, REVORDER is a generic problem with several possible extensions corresponding to various real-life applications. Previous works show that REVORDER has a polynomial complexity, whereas its optimization version, denoted in our work as MIN REVORDER, is NP-hard. We give a survey of methods and algorithms that can be applied to the solution of MIN REVORDER, and we develop a new enumeration scheme for its solution. Our theoretical analysis of this scheme yields several pruning techniques aimed at the reduction of the number of enumeration nodes. We then discuss how upper and lower bounds can be computed during the enumeration to design a branch-and-bound algorithm. Finally, we validate the branch-and-bound by conducting a large set of computational experiments on instances coming from various real-life applications. Our results highlight that the newly introduced pruning techniques allow for major reductions of computational cost, with a constant solution quality. In result, our branch-and-bound outperforms other existing solution methods: among 180 instances with 60 vertices, it solves 179 instances to optimality whereas the best existing method is only able to solve 109 of them. Moreover, our tests show that our algorithm can solve medium-scale instances including up to 500 vertices, which opens the perspective of handling new real-life problems. Our implementation of the branch-and-bound algorithm, together with all instances we have used, is publicly available on GitLab.","PeriodicalId":186223,"journal":{"name":"Open J. Math. Optim.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122074227","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 5

Revisiting a Cutting Plane Method for Perfect Matchings 重新审视完美匹配的切割平面方法

Open J. Math. Optim. Pub Date : 2019-08-28 DOI: 10.5802/ojmo.2

Amber Q Chen, Kevin K. H. Cheung, P. Kielstra, A. Winn

引用次数: 1

Frameworks and Results in Distributionally Robust Optimization 分布鲁棒优化的框架和结果

Open J. Math. Optim. Pub Date : 2019-08-13 DOI: 10.5802/ojmo.15

Hamed Rahimian, Sanjay Mehrotra

引用次数: 20

Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. VII. Inverse Semigroup Theory, Closures, Decomposition of Perturbations Gomory和Johnson无限群问题中的等变摄动。7逆半群理论，闭包，微扰的分解

Open J. Math. Optim. Pub Date : 2018-11-15 DOI: 10.5802/ojmo.16

R. Hildebrand, M. Köppe, Yuan Zhou