Pages that link to "Item:Q1207331"

The following pages link to Maximum \(k\)-covering of weighted transitive graphs with applications (Q1207331):

Displaying 11 items.

• A linear-time algorithm for the weighted feedback vertex problem on interval graphs (Q286981) (← links)
• The just-in-time scheduling problem in a flow-shop scheduling system (Q421784) (← links)
• Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
• Just-in-time scheduling with controllable processing times on parallel machines (Q975765) (← links)
• Optimal channel allocation for several types of cellular radio networks (Q1372738) (← links)
• \(d\)-transversals of stable sets and vertex covers in weighted bipartite graphs (Q2376794) (← links)
• Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems (Q2434268) (← links)
• Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey (Q2958665) (← links)
• (Q3109939) (← links)
• Algorithms for maximumk-colorings andk-coverings of transitive graphs (Q3783310) (← links)
• Maximum weighted independent sets on transitive graphs and applications (Q4225377) (← links)