Výsledky vyhledávání - "polynomial algorithm"

POLYNOMIAL ALGORITHM FOR FINDING A HAMILTONIAN CYCLE ON A GRAPH Autor Prokopenkov, Vladymyr

“…The subject of research is the solution of the problem of finding a Hamiltonian cycle on a graph, which in discrete mathematics belongs to the NP complexity class and still retains interest…”
Získat plný text

A faster polynomial algorithm for the constrained maximum flow problem Autor CALISKAN, Cenk

“… costs subject to the constraint that the total cost of flow should be within a budget…”
Získat plný text

A Strongly Polynomial Algorithm for Controlled Queues Autor Zadorojniy, Alexander, Even, Guy, Shwartz, Adam

“…We consider the problem of computing optimal policies of finite-state finite-action Markov decision processes (MDPs). A reduction to a continuum of constrained…”
Získat plný text

Single-machine scheduling with an external resource Autor Briskorn, Dirk, Davari, Morteza, Matuschke, Jannik

“…highlights•We study single-machine scheduling with an external resource.•We look at four different classes of problems with an external resource.•For each…”
Získat plný text

Single-machine scheduling of multiple projects with controllable processing times Autor Geng, Zhichao, Yuan, Jinjiang

“…•The single-machine multiple-project scheduling problems.•The processing times of jobs are controllable.•The processing cost of a project includes total…”
Získat plný text

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ískat plný text

An interior-point trust-region polynomial algorithm for convex quadratic minimization subject to general convex constraints Autor Lu, Ye, Yuan, Ya-Xiang

“… polynomial algorithm…”
Získat plný text

Scheduling on uniform parallel machines with periodic unavailability constraints Autor Kaabi, Jihene, Harrath, Youssef

“… Each machine is subject to one unavailability period. Different versions of the problem regarding the type of jobs…”
Získat plný text

Recent Advances of Disсrete Optimization and Scheduling

“… The subjects addressed in the ten research papers cover a broad spectrum of optimization algorithms, e.g…”
Získat plný text

Scheduling of unit-length jobs with bipartite incompatibility graphs on four uniform machines Autor Furmańczyk, H., Kubale, M.

“… ≥ s , respectively. Our aim is to find a schedule with a minimum possible length. We assume that jobs are subject to some kind of mutual exclusion constraints modeled by a bipartite incompatibility graph of degree Δ…”
Získat plný text

Good orientations of unions of edge‐disjoint spanning trees Autor Bang‐Jensen, Jørgen, Bessy, Stéphane, Huang, Jing, Kriesell, Matthias

“…In this paper, we exhibit connections between the following subjects: Tree packing in graphs and digraphs…”
Získat plný text

The Problem of Finding the Maximal Multiple Flow in the Divisible Network and its Special Cases Autor Smirnov, A. V.

“… constructing rules are described. The definitions of a divisible network and some associated subjects…”
Získat plný text

The problem of finding the maximum multiple flow in the divisible network and its special cases Autor Smirnov, A. V.

“… other. The network constructing rules are described. The definitions of a divisible network and some associated subjects are stated…”
Získat plný text

An Oracle Strongly Polynomial Algorithm for Bottleneck Expansion Problems Autor Zhang, Jianzhong, Liu, Zhenhong

“… The problem is how to expand the capacities of elements in E so that the capacity of $\cal F $ is as large as possible, subject to a given budget restriction…”
Získat plný text

Single machine batch scheduling with resource dependent setup and processing times Autor Cheng, T.C.Edwin, Janiak, Adam, Kovalyov, Mikhail Y.

“…Jobs are processed by a single machine in batches. A batch is a set of jobs processed contiguously and completed together when the processing of all jobs in…”
Získat plný text

Complexity of some inverse shortest path lengths problems Autor Cui, Tingting, Hochbaum, Dorit S.

“… The goal is to modify the arc weights, subject to a penalty on the deviation from the given weights, so that the shortest path lengths are equal to the prescribed values…”
Získat plný text

Stability in P5- and banner-free graphs Autor Lozin, V.V.

“…We prove polynomial solvability of the maximum stable set problem in P 5-free banner-free (( P 5, B)-free) graphs, where P 5 is the simple path on five…”
Získat plný text

Maximizing the number of mixed packages subject to variety constraints Autor Robb, David J., Trietsch, Dan

“…We develop a polynomial-time algorithm to optimise a variant of the one-dimensional bin-packing problem with side constraints. We also develop a…”
Získat plný text

Submodular function minimization and related topics Autor Fujishige, Satoru

“…It had been a long-standing open problem to devise a combinatorial polynomial algorithm for minimizing submodular functions…”
Získat plný text

Splitting trees Autor Hansen, Pierre, Hertz, Alain, Quinodoz, Nicolas

“… Subject to a mild condition, these numbers lead to find a ‘black-and-white coloring’ of a tree T. In such…”
Získat plný text