Matches in SemOpenAlex for { <https://semopenalex.org/work/W1504306194> ?p ?o ?g. }
Showing items 1 to 69 of
69
with 100 items per page.
- W1504306194 abstract "Linear programming is a very general and widely used framework. In this thesis we consider several combinatorial optimization problems that can be viewed as classes of linear programming problems with special structure. It is known that polynomial time algorithms exist for the general linear programming problem. It is not known, however, whether any of them are strongly polynomial (informally, a polynomial time algorithm is strongly polynomial if the number of arithmetic operations performed is bounded by a polynomial function of the number of variables and inequalities, i.e., is independent of the size of the numbers). In addition, it seems that the general problem is inherently sequential (fast parallel algorithms cannot be obtained). For problems with special structure, our goals are to develop sequential and parallel algorithms that are faster than those known for general linear programming and to determine whether strongly polynomial algorithms exist.We develop a technique that extends the classes of problems known to have strongly polynomial algorithms, or known to be quickly solvable in parallel. This technique is used to obtain a fast parallel algorithm and a strongly polynomial algorithm for detecting cycles in periodic graphs of fixed dimension. We mention additional applications to parametric extensions of problems where the number of parameters is fixed.We introduce algorithms for solving linear systems where each inequality involves at most two variables. These algorithms improve over the sequential and parallel running times of previous algorithms. These results are combined with additional ideas to yield faster algorithms for some generalized network flow problems." @default.
- W1504306194 created "2016-06-24" @default.
- W1504306194 creator A5026385549 @default.
- W1504306194 date "1992-01-01" @default.
- W1504306194 modified "2023-09-26" @default.
- W1504306194 title "Combinatorial algorithms for optimization problems" @default.
- W1504306194 cites W1966971203 @default.
- W1504306194 cites W1973117121 @default.
- W1504306194 cites W1979641885 @default.
- W1504306194 cites W2035144082 @default.
- W1504306194 cites W2090286414 @default.
- W1504306194 cites W2103985627 @default.
- W1504306194 cites W2150154671 @default.
- W1504306194 cites W2156036190 @default.
- W1504306194 hasPublicationYear "1992" @default.
- W1504306194 type Work @default.
- W1504306194 sameAs 1504306194 @default.
- W1504306194 citedByCount "2" @default.
- W1504306194 crossrefType "book" @default.
- W1504306194 hasAuthorship W1504306194A5026385549 @default.
- W1504306194 hasConcept C11413529 @default.
- W1504306194 hasConcept C114614502 @default.
- W1504306194 hasConcept C126255220 @default.
- W1504306194 hasConcept C134306372 @default.
- W1504306194 hasConcept C205658194 @default.
- W1504306194 hasConcept C311688 @default.
- W1504306194 hasConcept C33676613 @default.
- W1504306194 hasConcept C33923547 @default.
- W1504306194 hasConcept C41045048 @default.
- W1504306194 hasConcept C52486349 @default.
- W1504306194 hasConcept C90119067 @default.
- W1504306194 hasConceptScore W1504306194C11413529 @default.
- W1504306194 hasConceptScore W1504306194C114614502 @default.
- W1504306194 hasConceptScore W1504306194C126255220 @default.
- W1504306194 hasConceptScore W1504306194C134306372 @default.
- W1504306194 hasConceptScore W1504306194C205658194 @default.
- W1504306194 hasConceptScore W1504306194C311688 @default.
- W1504306194 hasConceptScore W1504306194C33676613 @default.
- W1504306194 hasConceptScore W1504306194C33923547 @default.
- W1504306194 hasConceptScore W1504306194C41045048 @default.
- W1504306194 hasConceptScore W1504306194C52486349 @default.
- W1504306194 hasConceptScore W1504306194C90119067 @default.
- W1504306194 hasLocation W15043061941 @default.
- W1504306194 hasOpenAccess W1504306194 @default.
- W1504306194 hasPrimaryLocation W15043061941 @default.
- W1504306194 hasRelatedWork W100926944 @default.
- W1504306194 hasRelatedWork W106665802 @default.
- W1504306194 hasRelatedWork W1637341777 @default.
- W1504306194 hasRelatedWork W187235213 @default.
- W1504306194 hasRelatedWork W2048068744 @default.
- W1504306194 hasRelatedWork W2065120342 @default.
- W1504306194 hasRelatedWork W2074771195 @default.
- W1504306194 hasRelatedWork W2096891389 @default.
- W1504306194 hasRelatedWork W2128626931 @default.
- W1504306194 hasRelatedWork W2189595797 @default.
- W1504306194 hasRelatedWork W2255082502 @default.
- W1504306194 hasRelatedWork W2576511634 @default.
- W1504306194 hasRelatedWork W2760274415 @default.
- W1504306194 hasRelatedWork W2766740319 @default.
- W1504306194 hasRelatedWork W2787200178 @default.
- W1504306194 hasRelatedWork W2895607801 @default.
- W1504306194 hasRelatedWork W2901729427 @default.
- W1504306194 hasRelatedWork W2948580656 @default.
- W1504306194 hasRelatedWork W2963004262 @default.
- W1504306194 hasRelatedWork W3171356084 @default.
- W1504306194 isParatext "false" @default.
- W1504306194 isRetracted "false" @default.
- W1504306194 magId "1504306194" @default.
- W1504306194 workType "book" @default.