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 2 of 2 for “"Maximum weighted independent set"”.

  1. SOLVING PROCESS PLANNING AND SCHEDULING PROBLEMS USING THE CONCEPT OF MAXIMUM WEIGHTED INDEPENDENT SET

    … The PPS problem is formulated into an undirected weighted conflicting graph, where nodes represent operations and their resources; edges represent constraints, and weight factors are guidelines for the node selection at each time slot. Then, the Maximum Weighted Independent Set (MWIS) problem, …

    syracuse-diss Repository record for SOLVING PROCESS PLANNING AND SCHEDULING PROBLEMS USING THE CONCEPT OF MAXIMUM WEIGHTED INDEPENDENT SET (opens in a new tab)

  2. Combinatorial optimization and recognition of graph classes with applications to related models

    … time algorithms for the minimum coloring and the maximum clique problems, as well as an improved O(n^2) time algorithm for the maximum weighted independent set problem on G. In spite of the extensive study of these classes, the recognition of both tolerance and bounded tolerance graphs have been …

    aachen Repository record for Combinatorial optimization and recognition of graph classes with applications to related models (opens in a new tab)