Search Results - subject:"greedy algorithm."

Sparse spanning portfolios and under-diversification with second-order stochastic dominance

Arvanitis, Stelios; Scaillet, Olivier; Topaloglou, Nikolas - 2024

Persistent link: https://www.econbiz.de/10014485760

Large independent sets in recursive Markov random graphs

Gupte, Akshay; Zhu, Yiran - In: Mathematics of operations research 50 (2025) 3, pp. 1611-1634

Persistent link: https://www.econbiz.de/10015444257

Logic-based Benders decomposition methods for the distributed permutation flow shop scheduling problem with production and transportation cost

Xiong, Fuli; Shi, Jiangbo; Jing, Lin; Ping, An - In: Computers & operations research : an international journal 179 (2025), pp. 1-20

Persistent link: https://www.econbiz.de/10015338597

A note on fast deterministic algorithms for non-monotone submodular maximization under a knapsack constraint

Cheng, Lu - In: Operations research letters : a journal of INFORMS … 61 (2025), pp. 1-7

Persistent link: https://www.econbiz.de/10015432142

Carousel greedy algorithms for the minimum stretch spanning tree problem

Wang, Jiaqi; Cerrone, Carmine; Golden, Bruce - In: Computers & operations research : an international journal 184 (2025), pp. 1-15

Persistent link: https://www.econbiz.de/10015519706

Minimizing makespan of a production batch within concurrent systems : seru production perspective

Gai, Yin; Yin, Yong; Tang, Jiafu; Liu, Shiqiang - In: Journal of management science and engineering 7 (2022) 1, pp. 1-18

it with a widely practiced greedy algorithm through experiments. We find that our optimal algorithm is robust in most … cases and the greedy algorithm is efficient when variability in production efficiencies is high. This result can guide us to ….g., new employees and/or new products assembly, the greedy algorithm is efficient. For other cases, our optimal algorithm …

Persistent link: https://www.econbiz.de/10013207231

Scheduling periodic messages on a shared link without buffering

Guiraud, Maël; Strozecki, Yann - In: Journal of scheduling : JOS 27 (2024) 5, pp. 461-484

Persistent link: https://www.econbiz.de/10015123329

An iterated greedy algorithm for the planning of yarn-dyeing boilers

Demir, Yunus - In: International transactions in operational research : a … 31 (2024) 1, pp. 115-139

Persistent link: https://www.econbiz.de/10014430432

A novel collaborative iterative greedy algorithm for hybrid flowshop scheduling problem with batch processing machines and variable sublots

Li, Chengshuai; Han, Yuyan; Zhang, Biao; Wang, Yuting; … - In: International journal of production research 62 (2024) 11, pp. 4076-4096

Persistent link: https://www.econbiz.de/10014547208

Multi-objective evolutionary search strategies in constraint programming

Bennetto, Robert; Vuuren, Jan van - In: Operations research perspectives 8 (2021), pp. 1-15

It has been shown that evolutionary algorithms are able to construct suitable search strategies for classes of Constraint Satisfaction Problems (CSPs) in Constraint Programming. This paper is an explanation of the use of multi-objective optimisation in contrast to simple additive weighting...

Persistent link: https://www.econbiz.de/10012435273