{"title":"Cut the chit-chat: a new framework for the application of generative language models for portfolio construction","authors":"Francesco A. Fabozzi, Ionut Florescu","doi":"10.1007/s10479-026-07418-0","DOIUrl":"10.1007/s10479-026-07418-0","url":null,"abstract":"<div><p>Current applications of generative language models (GLMs) for portfolio construction utilize the chat functionality of such models to forecast expected returns. The current literature classify outputs of these models using discrete labels that ignore the magnitude of sentiment. We show that this procedure is not optimal for cross-sectional portfolio construction. In this paper, we introduce <i>Logit Extraction</i>, a methodology for extracting the model’s assigned probabilities to sentiment labels, allowing for the formulation of a continuous-valued ranking variable for portfolio construction. We demonstrate that Logit Extraction significantly enhances risk-adjusted returns over previous discrete label approaches. We make available an open source implementation of Logit Extraction in the python package “TokenProbs”.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"366 1","pages":"375 - 398"},"PeriodicalIF":4.1,"publicationDate":"2026-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10479-026-07418-0.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149416300","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Optimization modeling in business and government: in honor of Professor John M. Mulvey on his 80th birthday","authors":"David Saunders, Stavros A. Zenios","doi":"10.1007/s10479-026-07445-x","DOIUrl":"10.1007/s10479-026-07445-x","url":null,"abstract":"","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"366 1","pages":"1 - 12"},"PeriodicalIF":4.1,"publicationDate":"2026-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149416227","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Van-Nam Huynh, Katsuhiro Honda, Bac H. Le, Masahiro Inuiguchi
{"title":"Uncertainty in data and decision analytics – IUKM 2023","authors":"Van-Nam Huynh, Katsuhiro Honda, Bac H. Le, Masahiro Inuiguchi","doi":"10.1007/s10479-026-07427-z","DOIUrl":"10.1007/s10479-026-07427-z","url":null,"abstract":"","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"365 1","pages":"1 - 3"},"PeriodicalIF":4.1,"publicationDate":"2026-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149125596","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Jaroslav Garvardt, Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
{"title":"Parameterized Local Search for Max c-Cut","authors":"Jaroslav Garvardt, Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz","doi":"10.1007/s10479-026-07426-0","DOIUrl":"10.1007/s10479-026-07426-0","url":null,"abstract":"<div><p>In the NP-hard <span>Max </span> <i>c</i><span>-Cut</span> problem, one is given an undirected edge-weighted graph <i>G</i> and aims to color the vertices of <i>G</i> with <i>c</i> colors such that the total weight of edges with distinctly colored endpoints is maximal. The case with <span>(c=2)</span> is the famous <span>Max Cut</span> problem. To deal with the NP-hardness of this problem, we study parameterized local search algorithms. More precisely, we study <span>LS Max</span> <i>c</i><span>-Cut</span> where we are also given a vertex coloring and an integer <i>k</i> and the task is to find a better coloring that changes the color of at most <i>k</i> vertices, if such a coloring exists; otherwise, the given coloring is <i>k</i>-optimal. We show that, for all <span>(cge 2)</span>, <span>LS Max </span> <i>c</i><span>-Cut</span> presumably cannot be solved in <span>(f(k)cdot n^{mathcal {O}(1)})</span> time even on bipartite graphs. We then present an algorithm for <span>LS Max </span> <i>c</i><span>-Cut</span> with running time <span>(mathcal {O}((3eDelta )^kcdot ccdot k^3cdot Delta cdot n))</span>, where <span>(Delta )</span> is the maximum degree of the input graph. Finally, we evaluate the practical performance of this algorithm in a hill-climbing approach as a post-processing for a state-of-the-art heuristic for <span>Max </span> <i>c</i><span>-Cut</span>. We show that using parameterized local search, the results of this state-of-the-art heuristic can be further improved on a set of standard benchmark instances.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"365 2-3","pages":"523 - 563"},"PeriodicalIF":4.1,"publicationDate":"2026-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10479-026-07426-0.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149391871","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Splitting decision-making units: A comprehensive DEA approach based on value and traditional efficiency","authors":"Mohammad Khoveyni, Robabeh Eslami","doi":"10.1007/s10479-026-07393-6","DOIUrl":"10.1007/s10479-026-07393-6","url":null,"abstract":"<div><p>Several data envelopment analysis (DEA) models have been proposed for splitting decision-making units (DMUs); however, existing approaches exhibit structural and implementational limitations. To address these issues, this study proposes two new splitting models that accommodate both negative and nonnegative data—one grounded in value efficiency analysis (VEA) and the other in traditional DEA. The proposed models (i) determine the maximum number of new DMUs according to input capacity, (ii) preserve total input usage while enabling output expansion, (iii) ensure efficiency of the newly generated DMUs in both DEA and VEA frameworks, (iv) are applicable to single-DMU splitting and admit linearization, and (v) incorporate decision-maker’s preferences within the VEA structure. Managerial and economic implications are discussed, and the applicability of the models is illustrated through four examples.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"365 2-3","pages":"637 - 687"},"PeriodicalIF":4.1,"publicationDate":"2026-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149391837","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An extension of Harsanyi’s linear tracing procedure for selecting a proper equilibrium","authors":"Lingxuan Tang, Yiyin Cao, Chuangyin Dang","doi":"10.1007/s10479-026-07413-5","DOIUrl":"10.1007/s10479-026-07413-5","url":null,"abstract":"<div><p>Proper equilibrium refines Selten’s perfect equilibrium by imposing a stricter requirement on trembles, which introduces computational challenges, especially in large games. Given the foundational role of Harsanyi’s linear and logarithmic tracing procedures in equilibrium selection theory, this paper introduces extensions of these procedures to select proper equilibria in normal-form games. We propose an extension of the linear tracing procedure by constructing a perturbed game with continuously differentiable polynomial functions, where each player optimizes a linear combination of the payoff function based on the strategies given by others and the payoff function based on a prior belief about the strategies. By applying the optimality condition, fixed-point argument, and variable transformation to the perturbed game, we establish the existence of a smooth path starting from a unique point and approaching a proper equilibrium. To enhance procedural efficiency, we develop an extension of the logarithmic tracing procedure tailored to approximate the extension of the linear tracing procedure. Additionally, we incorporate a continuously differentiable exponential function into the perturbed games and utilize error-bound analysis to establish smooth paths to proper equilibria. Numerical experiments demonstrate the efficiency and stability of our methods.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"365 2-3","pages":"723 - 763"},"PeriodicalIF":4.1,"publicationDate":"2026-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149391873","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Kennedy A. G. Araujo, Ernesto G. Birgin, Débora P. Ronconi
{"title":"Models, constructive heuristics, and benchmark instances for the flexible job shop scheduling problem with nonlinear routes and position-based learning","authors":"Kennedy A. G. Araujo, Ernesto G. Birgin, Débora P. Ronconi","doi":"10.1007/s10479-026-07414-4","DOIUrl":"10.1007/s10479-026-07414-4","url":null,"abstract":"<div><p>This paper addresses the flexible job shop scheduling problem with nonlinear routes and position-based learning effect. In this variant of the flexible job shop scheduling problem, precedence constraints of the operations constituting a job are given by an arbitrary directed acyclic graph, generalizing the classical case in which a total order is imposed. Additionally, it is assumed that a worker performing an operation at a machine undergoes a learning process: the more times a worker has performed an operation, the faster he or she will be able to complete it on subsequent repetitions. Mixed integer programming and constraint programming models are presented and compared in the present work. In addition, sets of benchmark instances and constructive heuristics are introduced. The problem we study here corresponds to modern problems of great relevance in the printing industry. The framework we introduce aims to assist authors in the design of novel, effective, and efficient methods. Instances with optimal solutions provide a means to evaluate the quality of solutions found by other methods. Constructive heuristics serve two purposes. First, they provide an initial solution to off-the-shelf exact methods, offering a warm start when addressing instances of the proposed models. They also lay the groundwork for developing algorithms, such as list scheduling, neighborhoods, local searches, and ultimately, metaheuristics.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"365 2-3","pages":"319 - 387"},"PeriodicalIF":4.1,"publicationDate":"2026-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10479-026-07414-4.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149391891","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Sim-approaches for the stochastic clustered team orienteering problem","authors":"Daniele Ferone, Paola Festa, Tommaso Pastore","doi":"10.1007/s10479-026-07411-7","DOIUrl":"10.1007/s10479-026-07411-7","url":null,"abstract":"<div><p>This paper introduces the Stochastic Clustered Team Orienteering Problem (SCTOP), a variant of the recently defined CluTOP where travel times are non-negative random variables. This problem aligns with the growing interest in prize-collecting problems and the challenge of optimizing routes under uncertainty. To address the Stochastic CluTOP, we propose a Simheuristic method integrating Monte Carlo simulations within an Adaptive Large Neighborhood Search (SimALNS). Additionally, we incorporate two policies, Continuous and Reactive, to adaptively manage the maximum route length in route generation process. The proposed approaches are validated on a well-established benchmark of the scientific literature to test the benefits of including Monte Carlo simulations in the route-design process and to evaluate the possible contributions of the two policies in case of higher profit variances. The results demonstrate that the Monte Carlo simulation allows SimALNS to consistently achieve higher stochastic performance compared to its deterministic counterpart. Moreover, the results highlight that across all algorithms tested, the Reactive strategy is the most effective.\u0000</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"365 2-3","pages":"497 - 522"},"PeriodicalIF":4.1,"publicationDate":"2026-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10479-026-07411-7.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149391877","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Optimisation models for the design of multiple self-consumption loops in semi-rural areas","authors":"Yohann Chasseray, Mathieu Besançon, Xavier Lorca, Éva Petitdemange","doi":"10.1007/s10479-026-07405-5","DOIUrl":"10.1007/s10479-026-07405-5","url":null,"abstract":"<div><p>Collective electricity self-consumption gains increasing interest in a context where localised consumption of energy is a lever of sustainable development. While easing energy distribution networks, collective self-consumption requires complementary prosumers’ profiles. Before determining the proper energy exchanges happening between these prosumers, one must ensure their compatibility in the context of collective self-consumption. Motivated by real use cases from a solar power producer, this article proposes network flow-based linear models to solve both the design aspect of the problem and the attribution of distribution flows between involved prosumers. Two main models are proposed, handling (i) single collective self-consumption loop creation and (ii) multiple loop creation. One of the objectives of this work is to provide models that can be applied at a strategic level which implies their extension to large time scale and large spatial scale. To do so, associated Benders and Dantzig-Wolfe decompositions are proposed to ensure model scalability along temporal and spatial dimensions. Proposed models are tested on realistic use cases to assess their performances.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"365 2-3","pages":"443 - 477"},"PeriodicalIF":4.1,"publicationDate":"2026-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149391892","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Enhancing data envelopment analysis: a comprehensive calibration with random forests","authors":"Zhichao Wang","doi":"10.1007/s10479-026-07403-7","DOIUrl":"10.1007/s10479-026-07403-7","url":null,"abstract":"<div><p>This paper proposes an algorithm integrating random forests (RF) and data envelopment analysis (DEA), termed RF-DEA, to address several methodological challenges commonly encountered in DEA applications, e.g., sensitivity to outliers and the ‘curse of dimensionality’. We show that by leveraging the strengths of RF, the DEA estimator with a calibrated frontier and input/output vectors can effectively mitigate the influence of outliers, identify redundant variables, and account for the influence of environmental variables. Evidence from Monte Carlo simulations demonstrates that these properties of RF-DEA yield substantial improvements in estimation accuracy compared to the conventional DEA. Through an empirical application to global production efficiency, we illustrate that this easy-to-implement method constitutes a viable alternative DEA estimator, capable of disentangling some practical challenges in efficiency analysis.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"365 2-3","pages":"805 - 828"},"PeriodicalIF":4.1,"publicationDate":"2026-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10479-026-07403-7.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149391859","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}