Pages that link to "Item:Q3670545"

The following pages link to An Introduction to Combinatorial Models of Dynamic Storage Allocation (Q3670545):

Displaying 11 items.

• A two-phase heuristic for strip packing: Algorithm and probabilistic analysis (Q579140) (← links)
• A provably efficient algorithm for dynamic storage allocation (Q756873) (← links)
• A note on the dynamic storage allocation problem (Q1064060) (← links)
• Dynamic spectrum allocation: the impotency of duration notification. (Q1588057) (← links)
• An approximation result for the interval coloring problem on claw-free chordal graphs (Q1613366) (← links)
• Assigning service requests in voice-over-internet gateway multiprocessors (Q1886507) (← links)
• CHECKCOL: improved local search for graph coloring (Q2458929) (← links)
• Coloring graphs by iterated local search traversing feasible and infeasible solutions (Q2467355) (← links)
• Embedding a novel objective function in a two-phased local search for robust vertex coloring (Q2482807) (← links)
• Some Exact and Asymptotic Solutions to Single Server Models of Dynamic Storage (Q2904312) (← links)
• Storage allocation under processor sharing II: Further asymptotic results (Q3081338) (← links)