Suchergebnisse - "Polynomial-time Algorithms"

Pooling Problems with Polynomial-Time Algorithms von Haugland, Dag, Hendrix, Eligius M. T.

“… At the network terminals, the flow composition is subject to restrictions referred to as quality constraints …”
Volltext

Complexity of single machine scheduling subject to nonnegative inventory constraints von Briskorn, Dirk, Choi, Byung-Cheon, Lee, Kangbok, Leung, Joseph, Pinedo, Michael

“… This paper focuses on single machine scheduling subject to inventory constraints …”
Volltext

Polynomially solvable personnel rostering problems von Smet, Pieter, Brucker, Peter, De Causmaecker, Patrick, Vanden Berghe, Greet

“… Personnel rostering is a personnel scheduling problem in which shifts are assigned to employees, subject to complex organisational and contractual time-related constraints …”
Volltext

Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices von Chen, Rubing, Yuan, Jinjiang

“… In this paper, we study the scheduling of proportional-linearly deteriorating jobs with positional due indices, release dates, deadlines and precedence …”
Volltext

Joint Optimal Routing and Power Allocation for Spectral Efficiency in Multihop Wireless Networks von Saad, Mohamed

“… This paper presents the first rigourously proven optimal, polynomial-time algorithms for two versions of the joint spectral-efficient routing and power allocation problem …”
Volltext

On a class of interdiction problems with partition matroids: complexity and polynomial-time algorithms von Ketkov, Sergey S, Prokopyev, Oleg A

“… Unlike classical network interdiction models where the leader is subject to a single budget constraint, in our setting, both the leader and the follower are subject to several independent capacity …”
Volltext

A faster algorithm for the resource allocation problem with convex cost functions von Shi, Cong, Zhang, Huanan, Qin, Chao

“… ) and prove that it has a computational complexity of O(nlog⁡nlog⁡N), which outperforms the best known polynomial-time algorithm with O(n(log⁡N)2) …”
Volltext

Statistically Efficient, Polynomial Time Algorithms for Combinatorial Semi Bandits von Cuvelier, Thibaut, Combes, Richard, Gourdin, Eric

“… We consider combinatorial semi-bandits over a set of arms \({\cal X} \subset \{0,1\}^d\) where rewards are uncorrelated across items. For this problem, the …”
Volltext

Bicriteria scheduling concerned with makespan and total completion time subject to machine availability constraints von Huo, Yumei, Zhao, Hairong

“… We focus on two parallel machines’ environment and the goal is to find preemptive schedules to optimize both makespan and total completion time subject to machine availability …”
Volltext

Scheduling unit-length jobs with precedence constraints of small height von Berger, André, Grigoriev, Alexander, Heggernes, Pinar, van der Zwaan, Ruben

“… We consider the problem of scheduling unit-length jobs on identical machines subject to precedence constraints …”
Volltext

Computation of the Highest Coefficients of Weighted Ehrhart Quasi-polynomials of Rational Polyhedra von Baldoni, V., Berline, N., De Loera, J. A., Köppe, M., Vergne, M.

“… This article concerns the computational problem of counting the lattice points inside convex polytopes, when each point must be counted with a weight …”
Volltext

Scheduling imprecise computation tasks on uniform processors von Wan, Guohua, Leung, Joseph Y.-T., Pinedo, Michael L.

“… For these objectives, we give polynomial time algorithms with time complexity O ( m n 4 ) , O ( m n 4 ) and O ( k m n 4 ) , respectively, where k is the number of distinct w-weights …”
Volltext

Preemptive multiprocessor task scheduling with release times and time windows von Bianco, L., Blazewicz, J., Dell'Olmo, P., Drozdowski, M.

Volltext

A Whirling Dervish: Polynomial-Time Algorithm for the Regional SRLG-Disjoint Paths Problem von 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 …”
Volltext

Nearly on line scheduling of preemptive independent tasks von Sanlaville, Eric

“… We discuss the problem of scheduling preemptive independent tasks, subject to release dates and due dates, on identical processors, so as to minimize the maximum lateness …”
Volltext

Polynomial-Time Algorithm for the Regional SRLG-disjoint Paths Problem von 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 …”
Volltext

Propose a Polynomial Time Algorithm for Total Completion Time Objective von 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 …”
Volltext

A note on a two-agent scheduling problem related to the total weighted late work von Zhang, Yuan, Yuan, Jinjiang

“… ) the general version. The authors presented polynomial-time algorithms for the first two versions and a pseudo-polynomial-time algorithm for the last one …”
Volltext

Using the binary representation of arc capacity in a polynomial time algorithm for the constrained maximum flow problem in directed networks von 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 …”
Volltext

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

“… We present a polynomial-time algorithm for computing a pair of link …”
Volltext