发布求助
文献互助 智能选刊 最新文献

Optimization Letters最新文献

筛选
英文 中文
Improved approximation algorithm for the parallel-machine customer order scheduling with delivery time and submodular rejection penalties 考虑交货时间和次模拒绝处罚的并行机客户订单调度的改进逼近算法
4区 数学
Optimization Letters Pub Date : 2023-10-30 DOI: 10.1007/s11590-023-02073-x
Bo Hou, Hongye Zheng, Wen Liu, Weili Wu, Ding-Zhu Du, Suogang Gao
{"title":"Improved approximation algorithm for the parallel-machine customer order scheduling with delivery time and submodular rejection penalties","authors":"Bo Hou, Hongye Zheng, Wen Liu, Weili Wu, Ding-Zhu Du, Suogang Gao","doi":"10.1007/s11590-023-02073-x","DOIUrl":"https://doi.org/10.1007/s11590-023-02073-x","url":null,"abstract":"","PeriodicalId":49720,"journal":{"name":"Optimization Letters","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136103416","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On the exact solution of the multi-depot open vehicle routing problem 多车场开放式车辆路径问题的精确解
4区 数学
Optimization Letters Pub Date : 2023-10-23 DOI: 10.1007/s11590-023-02072-y
Vinícius Carvalho Soares, Marcos Roboredo
{"title":"On the exact solution of the multi-depot open vehicle routing problem","authors":"Vinícius Carvalho Soares, Marcos Roboredo","doi":"10.1007/s11590-023-02072-y","DOIUrl":"https://doi.org/10.1007/s11590-023-02072-y","url":null,"abstract":"","PeriodicalId":49720,"journal":{"name":"Optimization Letters","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135412104","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Plants’ competition under autotoxicity effect: an evolutionary game 植物自毒效应下的竞争:一种进化博弈
4区 数学
Optimization Letters Pub Date : 2023-10-19 DOI: 10.1007/s11590-023-02069-7
Nikolaos Karagiannis-Axypolitidis, Fabrizio Panebianco, Giuliano Bonanomi, Francesco Giannino
{"title":"Plants’ competition under autotoxicity effect: an evolutionary game","authors":"Nikolaos Karagiannis-Axypolitidis, Fabrizio Panebianco, Giuliano Bonanomi, Francesco Giannino","doi":"10.1007/s11590-023-02069-7","DOIUrl":"https://doi.org/10.1007/s11590-023-02069-7","url":null,"abstract":"Abstract We develop a $$2times 2$$ <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mrow> <mml:mn>2</mml:mn> <mml:mo>×</mml:mo> <mml:mn>2</mml:mn> </mml:mrow> </mml:math> evolutionary matrix game to model vegetation dynamics due to the effect of autotoxicity. The phenomenon of autotoxicity refers to the rise in soil of negative conditions for plant performance induced by the plants themselves. Relating the Nash Equilibrium Strategies of the game to the stability of the equilibrium points of the induced population dynamics, we investigate under which conditions coexistence of low and highly sensitive to autotoxicity plants occurs and under which a monospecific population dominates the competition. Based on this classification, we investigate the optimal distribution of the two distinct types of plants in order to maximize the cumulative total fitness and determine if this distribution is stable. The primary outcome of this study is to analyze the necessary conditions for achieving the highest total fitness in both mixed and monospecific populations of low-sensitivity plants. In contrast, we argue that a monospecific population of highly sensitive plants can never maximize overall fitness.","PeriodicalId":49720,"journal":{"name":"Optimization Letters","volume":"156 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135729903","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Single machine scheduling with maintenance and position-based job eligibility constraints for battery manufacturing 电池制造中具有维护和基于岗位的工作资格约束的单机调度
4区 数学
Optimization Letters Pub Date : 2023-10-16 DOI: 10.1007/s11590-023-02071-z
Sang-Wook Lee, Hyun-Jung Kim
{"title":"Single machine scheduling with maintenance and position-based job eligibility constraints for battery manufacturing","authors":"Sang-Wook Lee, Hyun-Jung Kim","doi":"10.1007/s11590-023-02071-z","DOIUrl":"https://doi.org/10.1007/s11590-023-02071-z","url":null,"abstract":"","PeriodicalId":49720,"journal":{"name":"Optimization Letters","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136115379","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The truck–drone routing optimization problem: mathematical model and a VNS approach 卡车-无人机路线优化问题:数学模型和VNS方法
4区 数学
Optimization Letters Pub Date : 2023-10-10 DOI: 10.1007/s11590-023-02056-y
Malick Ndiaye, Ahmed Osman, Said Salhi, Batool Madani
{"title":"The truck–drone routing optimization problem: mathematical model and a VNS approach","authors":"Malick Ndiaye, Ahmed Osman, Said Salhi, Batool Madani","doi":"10.1007/s11590-023-02056-y","DOIUrl":"https://doi.org/10.1007/s11590-023-02056-y","url":null,"abstract":"","PeriodicalId":49720,"journal":{"name":"Optimization Letters","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136353588","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Buffered and Reduced Multidimensional Distribution Functions and Their Application in Optimization 缓冲和约简多维分布函数及其在优化中的应用
4区 数学
Optimization Letters Pub Date : 2023-10-09 DOI: 10.1007/s11590-023-02045-1
Bogdan Grechuk, Michael Zabarankin, Alexander Mafusalov, Stan Uryasev
{"title":"Buffered and Reduced Multidimensional Distribution Functions and Their Application in Optimization","authors":"Bogdan Grechuk, Michael Zabarankin, Alexander Mafusalov, Stan Uryasev","doi":"10.1007/s11590-023-02045-1","DOIUrl":"https://doi.org/10.1007/s11590-023-02045-1","url":null,"abstract":"Abstract For a random variable, superdistribution has emerged as a valuable probability concept. Similar to cumulative distribution function (CDF), it uniquely defines the random variable and can be evaluated with a simple one-dimensional minimization formula. This work leverages the structure of that formula to introduce buffered CDF (bCDF) and reduced CDF (rCDF) for random vectors. bCDF and rCDF are shown to be the minimal Schur-convex upper bound and the maximal Schur-concave lower bound of the multivariate CDF, respectively. Special structure of bCDF and rCDF is used to construct an algorithm for solving optimization problems with bCDF and rCDF in objective or constraints. The efficiency of the algorithm is demonstrated in a case study on optimization of a collateralized debt obligation with bCDF functions in constraints.","PeriodicalId":49720,"journal":{"name":"Optimization Letters","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135044277","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
A mathematical programming approach for recognizing binet matrices 识别二进制矩阵的数学规划方法
4区 数学
Optimization Letters Pub Date : 2023-10-06 DOI: 10.1007/s11590-023-02066-w
Konstantinos Papalamprou, Leonidas Pitsoulis, Balász Kotnyek
{"title":"A mathematical programming approach for recognizing binet matrices","authors":"Konstantinos Papalamprou, Leonidas Pitsoulis, Balász Kotnyek","doi":"10.1007/s11590-023-02066-w","DOIUrl":"https://doi.org/10.1007/s11590-023-02066-w","url":null,"abstract":"","PeriodicalId":49720,"journal":{"name":"Optimization Letters","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135350482","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Frugal and decentralised resolvent splittings defined by nonexpansive operators 由非扩张运营商定义的节俭和分散的解决方案分裂
4区 数学
Optimization Letters Pub Date : 2023-10-05 DOI: 10.1007/s11590-023-02064-y
Matthew K. Tam
{"title":"Frugal and decentralised resolvent splittings defined by nonexpansive operators","authors":"Matthew K. Tam","doi":"10.1007/s11590-023-02064-y","DOIUrl":"https://doi.org/10.1007/s11590-023-02064-y","url":null,"abstract":"Abstract Frugal resolvent splittings are a class of fixed point algorithms for finding a zero in the sum of the sum of finitely many set-valued monotone operators, where the fixed point operator uses only vector addition, scalar multiplication and the resolvent of each monotone operator once per iteration. In the literature, the convergence analyses of these schemes are performed in an inefficient, algorithm-by-algorithm basis. In this work, we address this by developing a general framework for frugal resolvent splitting which simultaneously covers and extends several important schemes in the literature. The framework also yields a new resolvent splitting algorithm which is suitable for decentralised implementation on regular networks.","PeriodicalId":49720,"journal":{"name":"Optimization Letters","volume":"440 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134977169","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Linear-size formulations for connected planar graph partitioning and political districting 连通平面图划分和政治区划的线性大小公式
4区 数学
Optimization Letters Pub Date : 2023-10-05 DOI: 10.1007/s11590-023-02070-0
Jack Zhang, Hamidreza Validi, Austin Buchanan, Illya V. Hicks
{"title":"Linear-size formulations for connected planar graph partitioning and political districting","authors":"Jack Zhang, Hamidreza Validi, Austin Buchanan, Illya V. Hicks","doi":"10.1007/s11590-023-02070-0","DOIUrl":"https://doi.org/10.1007/s11590-023-02070-0","url":null,"abstract":"","PeriodicalId":49720,"journal":{"name":"Optimization Letters","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134975788","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
On maximal and minimal elements for sets with respect to cones 关于锥的集合的极大和极小元
4区 数学
Optimization Letters Pub Date : 2023-10-04 DOI: 10.1007/s11590-023-02065-x
A. Farajzadeh
{"title":"On maximal and minimal elements for sets with respect to cones","authors":"A. Farajzadeh","doi":"10.1007/s11590-023-02065-x","DOIUrl":"https://doi.org/10.1007/s11590-023-02065-x","url":null,"abstract":"","PeriodicalId":49720,"journal":{"name":"Optimization Letters","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135645040","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信
小红书