Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 26 for “"polynomial algorithms"”.

  1. Polynomial Algorithms for the Lot-Sizing Problem

    … problem. This paper examines two dual based algorithms that have been developed for the simple plant location problem and applies these procedures to the lot-sizing problem. Each algorithm yields an integer optimal solution in a polynomial number of computations.

    clemson Repository record for Polynomial Algorithms for the Lot-Sizing Problem (opens in a new tab)

  2. Multiprocessor Scheduling with Availability Constraints

    … time. Since this problem is strongly NP-hard, polynomial ap- proximation algorithms are being studied for its solution. Among these, the best known are LPT (largest processing time first) and Multifit with their variants. We give a Multifit-based algorithm, FFDL Multifit, which has an optimal …

    tamu Repository record for Multiprocessor Scheduling with Availability Constraints (opens in a new tab)

  3. Embedding of Rigid Graphs in Grids

    … with a unique unit embedding. We present a few polynomial algorithms for embedding large rigid subgraphs of an arbitrary graph.

    chalmers Repository record for Embedding of Rigid Graphs in Grids (opens in a new tab)

  4. Matchings with a size constraint

    … and (g, f)-factors. This thesis aims at polynomial algorithms which in addition have other properties. In particular, we develop a polynomial algorithm which can find optimal solutions of each possible size for weighted matching problem, and a strongly polynomial algorithm which can find …

    ubc Repository record for Matchings with a size constraint (opens in a new tab) Download PDF for Matchings with a size constraint (opens in a new tab)

  5. Benchmarking Permutation Flow Shop Problem: Adaptive and Enumerative Approaches Implementations via Novel Threading Techniques

    … path problem are some which are solvable through polynomial algorithms. Even though there are other problems such as crew scheduling, vehicle routing, production planning, and hotel room operations which have no properties such as to solve the problem with polynomial algorithms. All these problems …

    unlv Repository record for Benchmarking Permutation Flow Shop Problem: Adaptive and Enumerative Approaches Implementations via Novel Threading Techniques (opens in a new tab) Download PDF for Benchmarking Permutation Flow Shop Problem: Adaptive and Enumerative Approaches Implementations via Novel Threading Techniques (opens in a new tab)

  6. Generalized Vulnerability Measures of Graphs

    … versions of connectivity and integrity, when polynomial algorithms for computation exist, and other characteristics of the generalized measures.

    clemson Repository record for Generalized Vulnerability Measures of Graphs (opens in a new tab)

  7. Scheduling jobs on two uniform parallel machines to minimize the makespan

    … We propose several heuristic-based online algorithms for machines with different speeds called Q2||Cmax. To show the efficiency of the proposed online algorithms, we compute the optimal solution for Q2||Cmax using pseudo-polynomial algorithms based on dynamic programming method. The …

    unlv Repository record for Scheduling jobs on two uniform parallel machines to minimize the makespan (opens in a new tab) Download PDF for Scheduling jobs on two uniform parallel machines to minimize the makespan (opens in a new tab)

  8. Supply chain scheduling with delivery costs

    … computational complexity. Then we propose pseudo-polynomial algorithms for optimal solutions. For some problems, the pseudo-polynomial algorithms perform in polynomial time for some special cases. Finally, we develop efficient approximation algorithms or fully polynomial time approximation …

    mcmaster Repository record for Supply chain scheduling with delivery costs (opens in a new tab)

  9. Shop problems in scheduling

    … In this thesis, several shop problems and their algorithms will be introduced that I have researched. There are several examples and counter examples that I have constructed. Also I will discuss how an arbitrary problem that can be solved polynomially can be changed so that there are no …

    unlv Repository record for Shop problems in scheduling (opens in a new tab) Download PDF for Shop problems in scheduling (opens in a new tab)

  10. Generalizations of comparability graphs

    … many other optimization problems are solved by polynomial algorithms. It also has close connections with other classes of graphs, such as interval graphs, permutation graphs, and perfect graphs. In this dissertation, we define new measures for transitivity to generalize comparability graphs. We …

    colostate Repository record for Generalizations of comparability graphs (opens in a new tab)

  11. A parametric classification of directed acyclic graphs

    … that these four problems can be solved in polynomial time on transitive DAGs. It is also known that there can be no polynomial O(n1-ϵ)-approximation algorithms for these problems on the general class of DAGs unless P = NP. We propose a new parameter, β, as a measure of departure from …

    colostate Repository record for A parametric classification of directed acyclic graphs (opens in a new tab)

  12. Algorithms and Complexity for Alliances and Weighted Alliances of Various Types

    … recently, no research has been done to develop algorithms or establish the complexity of decision problems for alliances in graphs. This thesis presents the first algorithmic study of alliances in graphs. We present linear algorithms for finding various alliance numbers in trees and series …

    clemson Repository record for Algorithms and Complexity for Alliances and Weighted Alliances of Various Types (opens in a new tab)

  13. Algorithms for Integer Programming and Allocation

    The first part of the thesis contains pseudo-polynomial algorithms for integer linear programs (ILP). When certain parameters of an ILP are fixed, that is, they are treated as constants in the running time, it is possible to obtain algorithms with a running time that is pseudo-polynomial in the …

    cau-kiel Repository record for Algorithms for Integer Programming and Allocation (opens in a new tab)

  14. Polynomial Time Algorithms for Transportation and Inventory Management in Serial Supply Chain with Multi-Module Capacitated Vehicles

    … are NP-hard when n is part of the input and polynomially solvable for n = 1, the complexity status for fixed n ≥ 2 has remained open. We resolve this question by developing exact fixed-parameter tractable algorithms that solve MCLS and MCLS-S in O(T2n+3) time for any fixed n ≥ 2. Our results …

    vt Repository record for Polynomial Time Algorithms for Transportation and Inventory Management in Serial Supply Chain with Multi-Module Capacitated Vehicles (opens in a new tab)

  15. SUPERVISORY CONTROL AND FAILURE DIAGNOSIS OF DISCRETE EVENT SYSTEMS: A TEMPORAL LOGIC APPROACH

    … logic (LTL) are also studied; and for which algorithms of better complexity are provided. For the failure diagnosis of DESs, LTL is used to express fault specifications. Failure diagnosis problem of DES in the temporal logic setting is formulated; and the diagnosability of DES is defined. The …

    uky-thes Repository record for SUPERVISORY CONTROL AND FAILURE DIAGNOSIS OF DISCRETE EVENT SYSTEMS: A TEMPORAL LOGIC APPROACH (opens in a new tab)

  16. Cost/revenue allocation on networks

    … considered in my thesis. Efficient, strongly polynomial algorithms are then developed for calculating the nucleolus of these games. Although the general approach in Chapters 2 and 3 is similar, the techniques used in each chapter for developing the computational algorithms are different. In …

    ubc Repository record for Cost/revenue allocation on networks (opens in a new tab) Download PDF for Cost/revenue allocation on networks (opens in a new tab)

  17. On Extremal, Algorithmic, and Inferential Problems in Graph Theory

    … approach, we design deterministic and randomized algorithms using a near optimal number of colors in the sequential setting as well as in the LOCAL model of distributed computing. Additionally, we study list-edge-coloring for list assignments satisfying certain local constraints, and describe a …

    gatech Repository record for On Extremal, Algorithmic, and Inferential Problems in Graph Theory (opens in a new tab)

  18. Unfolding and Reconstructing Polyhedra

    … disprove some existing conjectures regarding algorithms to unfold convex polyhedra without overlaps. The work on reconstruction is centered around analyzing the computational complexity of a number of reconstruction questions. We consider two classes of reconstruction problems. The first …

    waterloo Repository record for Unfolding and Reconstructing Polyhedra (opens in a new tab)

  19. An algorithmic approach to center location and related problems.

    … to be NP-hard for case of a general graph, yet polynomial algorithms exist for the case of a tree graph. Specifically, we consider "cactus graphs" where each edge is contained in at most one cycle. We show that the p-center problem on this class can be solved in polynomial time using a …

    arizona-thes Repository record for An algorithmic approach to center location and related problems. (opens in a new tab)

  20. Game-theoretic network centrality

    … be expressed in our framework are computable in polynomial time. The framework applies to a broad class of division schemes called semivalues in combination with a very wide range of group centrality measures, which is the first result of its kind to date.</p> <p>Our second focus is on a class of …

    oxford Repository record for Game-theoretic network centrality (opens in a new tab)

Page 1 of 2