Výsledky vyhľadávania - "greedy algorithm"

Self-Adaptive Population-Based Iterated Greedy Algorithm for Distributed Permutation Flowshop Scheduling Problem with Part of Jobs Subject to a Common Deadline Constraint Autor Li, Qiu-Ying, Pan, Quan-Ke, Sang, Hong-Yan, Jing, Xue-Lei, Framiñán, Jose M., Li, Wei-Min

“… This paper addresses a DPFSP with part of jobs subject to a common deadline (DPFSP-PJCD). The objective is to minimize the total completion time…”
Získať plný text

An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time Autor Nagano, Marcelo Seido, de Almeida, Fernando Siqueira, Miyata, Hugo Hissashi

“…This article addresses the m-machine no-wait flowshop scheduling problem with the objective of minimizing makespan subject to an upper bound on total completion time…”
Získať plný text

Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice: Continuous Greedy Algorithm on Median Complex Autor Maehara, Takanori, Nakashima, So, Yamaguchi, Yutaro

“… )-approximation algorithm for this problem. To achieve this result, we generalize the continuous greedy algorithm to distributive lattices…”
Získať plný text

Randomized greedy algorithm for helicopter optimization in the energy industry: a practical approach to model development and solution deliverance Autor Navarre, Jeremy T

“… by 19 firms are optimized via a randomized greedy algorithm. The study’s…”
Získať plný text

Effective Heuristics and an Iterated Greedy Algorithm to Schedule Identical Parallel Machines Subject to Common Restrictive Due Windows Autor Rolim, Gustavo Alencar, Nagano, Marcelo Seido, Prata, Bruno de Athayde

“…In this paper, we address a variant of the identical parallel machines scheduling problem subject to common restrictive due windows…”
Získať plný text

An efficient iterated greedy algorithm for a multi-objective no-wait flow shop problem with sequence dependent setup times Autor de Almeida, Fernando Siqueira, Nagano, Marcelo Seido

“… The objective is to minimize total tardiness subject to an upper bound on makespan. Although these constraints and performance measures have all been extensively studied independently, they have never been considered together in this problem…”
Získať plný text

A two-stage iterated greedy algorithm and a multi-objective constructive heuristic for the mixed no-idle flowshop scheduling problem to minimize makespan subject to total completion time Autor Nagano, Marcelo Seido, Rossi, Fernando Luis

“… This paper investigates the multi-objective mixed no-idle flowshop scheduling problem. The addressed optimization case is minimizing makespan subject to an upper bound on total completion time…”
Získať plný text

Automatic piano performance interaction system based on greedy algorithm for dexterous manipulator Autor Yufei Wang, Junfeng Yao, Yalan Zhou, Zefeng Wang

“… To address this issue, we propose a user-friendly and innovative interaction system based on the principles of greedy algorithms…”
Získať plný text

Two-stage iterated greedy algorithm for distributed flexible assembly permutation flowshop scheduling problems with sequence-dependent setup times Autor Li, Yuan-Zhen, Meng, Lei-Lei, Zhang, Biao

“…In this study, the distributed flexible assembly permutation flowshop scheduling problem (DFAPFSP) with sequence-dependent setup times and makespan criterion…”
Získať plný text

Phasor Measurement Units Allocation Against Load Redistribution Attacks Based on Greedy Algorithm Autor Ali Rahdan, Ali Khaleghi

“…Power grid vulnerability to various cyber-attacks will undoubtedly increase with the widespread use of cutting-edge computer technologies in power systems…”
Získať plný text

An accelerated continuous greedy algorithm for maximizing strong submodular functions Autor Wang, Zengfu, Moran, Bill, Wang, Xuezhi, Pan, Quan

“…An accelerated continuous greedy algorithm is proposed for maximization of a special class of non-decreasing submodular functions f : 2 X → R…”
Získať plný text

A generalized l1 greedy algorithm for image reconstruction in CT Autor Zhu, Jiehua, Li, Xiezhang

“… Recently, the reweighted l1 minimization and l1 greedy algorithm have been introduced to improve the convergence of the l1 minimization problem…”
Získať plný text

AN X-GREEDY ALGORITHM WITH WEAKNESS PARAMETERS Autor Causey, Ryan, Dilworth, Stephen J, Gogyan, Smbat, Kutzarova, Denka

“…We prove that in the space [mathematical expression not reproducible], where [F.sub.n] are finite-dimensional smooth spaces, the X-Greedy Algorithm with weakness parameters converges for some special…”
Získať plný text

Approximation algorithm of maximizing non-monotone non-submodular functions under knapsack constraint Autor Shi, Yishuo, Lai, Xiaoyan

“… In our paper, we discuss the maximization of the non-monotone non-submodular functions under a knapsack constraint, which even might be negative, and explore the performance under the greedy algorithm…”
Získať plný text

On maximizing a monotone k-submodular function subject to a matroid constraint Autor Sakaue, Shinsaku

“…A k-submodular function is an extension of a submodular function in that its input is given by k disjoint subsets instead of a single subset. For unconstrained…”
Získať plný text

Kinship Decouple and Phenotype Selection (KDPS): a tool for phenotype-aware decoupling of related subjects Autor Gu, Wanjun, Xi, Jiachen, Cao, Steven, Salem, Rany M

“… Existing tools to break relatedness are phenotype-naïve; they indiscriminately remove subjects to break relationship, risking the loss of valuable data, especially in studies targeting uncommon and rare phenotypes…”
Získať plný text

Approximation algorithm of maximizing non-submodular functions under non-submodular constraint Autor Lai, Xiaoyan, Shi, Yishuo

“…Nowadays, maximizing the non-negative and non-submodular objective functions under Knapsack constraint or Cardinality constraint is deeply researched…”
Získať plný text

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

“…We present a refined analysis of a variant of the algorithm in the literature for solving the knapsack-constrained submodular maximization problem. By deriving…”
Získať plný text

A Unified Continuous Greedy Algorithm for Submodular Maximization Autor Feldman, Moran, Naor, Joseph, Schwartz, Roy

“…The study of combinatorial problems with a submodular objective function has attracted much attention in recent years, and is partly motivated by the…”
Získať plný text

Complexity and relaxation methods for minimising total average cycle stock subject to practical constraints Autor Myung, Young-Soo, Moon, Ilkyeong

“…This paper considers the problem of minimising total average cycle stock that is subject to practical constraints, as first studied by Silver and Moon and later by Hsieh, and Billionnet…”
Získať plný text