Výsledky vyhľadávania - "polynomial time algorithm"

A Whirling Dervish: Polynomial-Time Algorithm for the Regional SRLG-Disjoint Paths Problem Autor Vass, Balazs, Berczi-Kovacs, Erika R., Barabas, Abel, Hajdu, Zsombor Laszlo, Tapolcai, Janos

“… The set of network elements subject to potential failure events is called Shared Risk Link Group (SRLG…”
Získať plný text

Polynomial-Time Algorithm for the Regional SRLG-disjoint Paths Problem Autor Vass, Balazs, Berczi-Kovacs, Erika, Barabas, Abel, Hajdu, Zsombor Laszlo, Tapolcai, Janos

“… The set of network elements subject to potential failure events is called Shared Risk Link Group (SRLG…”
Získať plný text

Propose a Polynomial Time Algorithm for Total Completion Time Objective Autor Ozturkoglu, Yucel, Ozturkoglu, Omer

“…In this study, we integrate deteriorate jobs with repair&maintenance activity on a single machine scheduling subject to total completion time…”
Získať plný text

Using the binary representation of arc capacity in a polynomial time algorithm for the constrained maximum flow problem in directed networks Autor Tlas, Muhammad

“…In this paper, the binary representation of arc capacity has been used in developing an efficient polynomial time algorithm for the constrained maximum flow problem in directed networks…”
Získať plný text

A Polynomial-Time Algorithm for Computing Disjoint Lightpath Pairs in Minimum Isolated-Failure-Immune WDM Optical Networks Autor Xue, Guoliang, Gottapu, Ravi, Fang, Xi, Yang, Dejun, Thulasiraman, Krishnaiyan

“… We present a polynomial-time algorithm for computing a pair of link…”
Získať plný text

A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid Autor Goldberg, Leslie Ann, Jerrum, Mark

“…) for the class of graphic matroids. On the other hand, the authors have previously shown, subject to a complexity-theoretic assumption, that there is no FPRAS for the class of binary matroids, which is a proper superset of the class of graphic matroids…”
Získať plný text

A polynomial-time algorithm for designing FIR filters with power-of-two coefficients Autor Li, Dongning, Lim, Yong Ching, Lian, Yong, Song, Jianjian

“…This paper presents a polynomial-time algorithm for designing digital filters with coefficients expressible as sums of signed power-of-two (SPT) terms…”
Získať plný text

A polynomial time algorithm for production planning with bounded inventory Autor Liu, X.

“…In petrochemical manufacturing, food processing, glass manufacturing, etc., there is a situation where the production planning is subject to the limit of inventory capacity…”
Získať plný text

Total completion time minimization on multiple machines subject to machine availability and makespan constraints Autor Huo, Yumei, Zhao, Hairong

“…  is the maximum processing time among all jobs. We show that there is an optimal polynomial time algorithm…”
Získať plný text

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

“… The single-unit commitment problem (1UC) is the problem of finding a cost optimal schedule for a single generator given a time series of electricity prices subject to generation limits, minimum up- and downtime and ramping limits…”
Získať plný text

Two-agent parallel-machine scheduling with rejection Autor Li, Dawei, Lu, Xiwen

“… The objective is to minimize the sum of the given objective function fA of the accepted A-jobs and the total rejection penalty of the rejected A-jobs subject to an upper bound on the sum of the given…”
Získať plný text

Scheduling problems with rejection in green manufacturing industry Autor Kong, Fanyu, Song, Jiaxin, Miao, Cuixia, Zhang, Yuzhong

“… is not more than a given threshold. We present pseudo-polynomial time algorithms and 2-approximation algorithms for the single-machine and the parallel-machine problems, respectively…”
Získať plný text

Parallel machine makespan minimization subject to machine availability and total completion time constraints Autor Huo, Yumei

“… For each model, we show that there is an optimal polynomial time algorithm…”
Získať plný text

Bicriteria scheduling of equal length jobs on uniform parallel machines Autor Zhao, Qiulan, Yuan, Jinjiang

“…We study the bicriteria scheduling of equal length jobs on uniform parallel machines. By introducing a new scheduling model, called single-machine scheduling…”
Získať plný text

Polynomial time recognition of vertices contained in all (or no) maximum dissociation sets of a tree Autor Tu, Jianhua, Zhang, Lei, Du, Junfeng, Lang, Rongling

“…In a graph $ G $, a dissociation set is a subset of vertices which induces a subgraph with vertex degree at most 1. Finding a dissociation set of maximum…”
Získať plný text

Stable matchings of teachers to schools Autor Cechlárová, Katarína, Fleiner, Tamás, Manlove, David F., McBride, Iain

“… Our model is motivated by a particular characteristic of the education system in many countries where each teacher specializes in two subjects…”
Získať plný text

On solving a non-convex quadratic programming problem involving resistance distances in graphs Autor Dubey, Dipti, Neogy, S. K.

“… ). In this paper, we consider the question of solving the quadratic programming problem of finding maximum of x T R x subject to x being a nonnegative vector with sum 1 and show that for the…”
Získať plný text

A Polynomial Time Algorithm for Shaped Partition Problems Autor Hwang, Frank K., Onn, Shmuel, Rothblum, Uriel G.

“… on the sum of vectors in each part, subject to arbitrary constraints on the number of elements in each part…”
Získať plný text

Proportionate flow-shop scheduling with rejection Autor Shabtay, Dvir, Oron, Daniel

“…In many heavily loaded manufacturing systems, managers routinely make use of outsourcing options in order to maintain reasonable Quality of Service for…”
Získať plný text

Single machine batch scheduling with two non-disjoint agents and splitable jobs Autor Geng, Zhichao, Liu, Jiayu

“… of the jobs of agent A subject to the maximum cost of the jobs of agent B being upper bounded by a given threshold…”
Získať plný text