Search Results - "new dynamic programming algorithms"

New dynamic programming algorithms for the resource constrained elementary shortest path problem by Righini, Giovanni, Salani, Matteo

“…The resource constrained elementary shortest path problem (RCESPP) arises as a pricing subproblem in branch‐and‐price algorithms for vehicle‐routing problems…”
Get full text

New Dynamic Programming algorithm for the Multiobjective Minimum Spanning Tree problem by Maristany de las Casas, Pedro, Sedeño-Noda, Antonio, Borndörfer, Ralf

“…The Multiobjective Minimum Spanning Tree (MO-MST) problem generalizes the Minimum Spanning Tree problem by weighting the edges of the input graph using vectors…”
Get full text

A new dynamic programming algorithm for the simplified partial digest problem by Wang, Biing-Feng

“… We give a new dynamic programming algorithm that requires O(qn(n/q+1)q−1) time. This time complexity is O(nq…”
Get full text

New Dynamic Programming Algorithm for the Multiobjective Minimum Spanning Tree Problem by Pedro Maristany de las Casas, Sedeño-Noda, Antonio, Borndörfer, Ralf

“…The Multiobjective Minimum Spanning Tree (MO-MST) problem is a variant of the Minimum Spanning Tree problem, in which the costs associated with every edge of…”
Get full text

A Note on "Flowshop Scheduling with Learning Effectand Job Rejection" by Yu, Jin, Liu, Pei-Hai, Lu, Xi-Wen

“…) are incorrect by counterexamples. Moreover, we propose new dynamic programming algorithms to solve the corresponding problems…”
Get full text

A new dynamic programming algorithm to workspiece sort problem by Xusong, Xu, Dacheng, Liu, Jing, Lu

“…This paper provides a new dynamic programming algorithm for solving workpiese sort problem This algorithm sort set of n workpieces in the calculating time of O…”
Get full text

An improved algorithm for single-unit commitment with ramping limits by Wuijts, Rogier Hans, van den Akker, Marjan, van den Broek, Machteld

“…•Two new dynamic programming algorithms for the single unit commitment problem.•Algorithm for convex generation cost that grows linear in practice…”
Get full text

On the generalized constrained longest common subsequence problems by Chen, Yi-Ching, Chao, Kun-Mao

“…) P as a subsequence (or substring). We propose new dynamic programming algorithms for solving the GC-LCS problems in O ( mn ρ ) time…”
Get full text

Probabilistic single-individual haplotyping by Kuleshov, Volodymyr

“… Here, we introduce ProbHap, a haplotyping algorithm targeted at such technologies. The main algorithmic idea of ProbHap is a new dynamic programming algorithm…”
Get full text

Progressive multiple sequence alignment with indel evolution by Maiolo, Massimo, Zhang, Xiaolei, Gil, Manuel, Anisimova, Maria

“…Background Sequence alignment is crucial in genomics studies. However, optimal multiple sequence alignment (MSA) is NP-hard. Thus, modern MSA methods employ…”
Get full text

Alternative algorithms for identical machines scheduling to maximize total early work with a common due date by Chen, Xin, Shen, Xuefeng, Kovalyov, Mikhail Y., Sterna, Malgorzata, Blazewicz, Jacek

“…}, which is known to be NP-hard. A new dynamic programming algorithm is proposed, which is more efficient than the existing exact approach for this problem…”
Get full text

DIAL: a web server for the pairwise alignment of two RNA three-dimensional structures using nucleotide, dihedral angle and base-pairing similarities by Ferrè, F, Ponty, Y, Lorenz, W.A, Clote, Peter

“…DIAL (dihedral alignment) is a web server that provides public access to a new dynamic programming algorithm for pairwise 3D structural alignment of RNA…”
Get full text

Incorporating Epidemiological Data into the Genomic Analysis of Partially Sampled Infectious Disease Outbreaks by Carson, Jake, Keeling, Matt, Ribeca, Paolo, Didelot, Xavier

“… Here, we present a new dynamic programming algorithm to perform this task efficiently…”
Get full text

Investigation of novel intelligent energy management strategies for connected HEB considering global planning of fixed-route information by Wang, Yue, Li, Keqiang, Zeng, Xiaohua, Gao, Bolin, Hong, Jichao

“… At the cloud layer, the optimal SOC and working mode of global planning is solved by a new dynamic programming algorithm with termination state constraints under the representative cycle of fixed-route…”
Get full text

Recursively decomposable graph techniques and applications to non-graph problems by Kortright, Martin Eduardo

“… decomposability properties. It presents many new dynamic programming algorithms for such non-graph problems, expressing them by means of a set of simple generic operations…”
Get full text

Joint segmentation, calling, and normalization of multiple CGH profiles by Picard, Franck, Lebarbier, Emilie, Hoebeke, Mark, Rigaill, Guillem, Thiam, Baba, Robin, Stéphane

“…The statistical analysis of array comparative genomic hybridization (CGH) data has now shifted to the joint assessment of copy number variations at the cohort…”
Get more information

An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems by Russo, Mauro, Sforza, Antonio, Sterle, Claudio

“…In the unconstrained two-dimensional cutting problems (U2DCP) small rectangular objects have to be extracted from a large rectangular sheet, with no limits on…”
Get full text

A Stereo Dual-Channel Dynamic Programming Algorithm for UAV Image Stitching by Li, Ming, Chen, Ruizhi, Zhang, Weilong, Li, Deren, Liao, Xuan, Wang, Lei, Pan, Yuanjin, Zhang, Peng

“… Secondly, a new dynamic programming algorithm is developed based on the concept of a stereo dual-channel energy accumulation…”
Get full text

A Rapid and Scalable Method for Multilocus Species Delimitation Using Bayesian Model Comparison and Rooted Triplets by Fujisawa, Tomochika, Aswad, Amr, Barraclough, Timothy G.

“…Abstract Multilocus sequence data provide far greater power to resolve species limits than the single locus data typically used for broad surveys of clades…”
Get full text

Dynafold: a dynamic programming approach to protein backbone structure determination from minimal sets of Residual Dipolar Couplings by Mukhopadhyay, Rishi, Irausquin, Stephanie, Schmidt, Christopher, Valafar, Homayoun

“… DynaFold is a new dynamic programming algorithm designed specifically for this task, using minimal sets of RDCs collected in multiple alignment media…”
Get more information