Pages that link to "Item:Q3335004"

The following pages link to On Some Variants of the Bandwidth Minimization Problem (Q3335004):

Displaying 44 items.

• Tabu search for the cyclic bandwidth problem (Q337475) (← links)
• A special antidilation problem for meshes and Hamming graphs (Q432721) (← links)
• A note on maximum differential coloring of planar graphs (Q473207) (← links)
• Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
• Memetic algorithm for the antibandwidth maximization problem (Q623314) (← links)
• Two models of two-dimensional bandwidth problems (Q656608) (← links)
• Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay. (Q703281) (← links)
• The connection between the bump number problem and flow-shop scheduling with precedence constraints (Q753673) (← links)
• Separation numbers of trees (Q837168) (← links)
• The complexity of finding uniform emulations on paths and ring networks (Q918210) (← links)
• Antibandwidth of three-dimensional meshes (Q960961) (← links)
• Antibandwidth and cyclic antibandwidth of meshes and hypercubes (Q1025547) (← links)
• On explicit formulas for bandwidth and antibandwidth of hypercubes (Q1026164) (← links)
• Antibandwidth of complete \(k\)-ary trees (Q1045176) (← links)
• Computing the bump number with techniques from two-processor scheduling (Q1106865) (← links)
• Fixed hypercube embedding (Q1108043) (← links)
• The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability (Q1176232) (← links)
• Scheduling real-time computations with separation constraints (Q1198025) (← links)
• Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
• Bandwidth contrained NP-complete problems (Q1822500) (← links)
• Scheduling dyadic intervals (Q1902894) (← links)
• A note on computational approaches for the antibandwidth problem (Q2051212) (← links)
• Optimizing consolidation processes in hubs: the hub-arrival-departure problem (Q2076886) (← links)
• A general variable neighborhood search for the cyclic antibandwidth problem (Q2114825) (← links)
• A metric approach for scheduling problems with minimizing the maximum penalty (Q2245804) (← links)
• The complexity of graph languages generated by hyperedge replacement (Q2277851) (← links)
• Contrast in greyscales of graphs (Q2307508) (← links)
• The maximum \(k\)-differential coloring problem (Q2407949) (← links)
• Antibandwidth and cyclic antibandwidth of Hamming graphs (Q2446319) (← links)
• Cyclic bandwidth with an edge added (Q2462360) (← links)
• Lower bounds for the bandwidth problem (Q2669517) (← links)
• Antibandwidth and cyclic antibandwidth of Hamming graphs (Q2851478) (← links)
• GRASP with path relinking heuristics for the antibandwidth problem (Q3100697) (← links)
• The Cyclic Antibandwidth Problem (Q3439338) (← links)
• Antibandwidth of Complete k-Ary Trees (Q3439448) (← links)
• Antibandwidth of Three-Dimensional Meshes (Q3439580) (← links)
• The Effective Bandwidth Problem Revisited (Q3548747) (← links)
• On circular layouts^∗ (Q3806838) (← links)
• The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues (Q4012672) (← links)
• (Q4543985) (← links)
• Level-based heuristics and hill climbing for the antibandwidth maximization problem (Q4982954) (← links)
• Deep two-way matrix reordering for relational data analysis (Q6055223) (← links)
• Minimum gradation in greyscales of graphs (Q6108924) (← links)
• Population-based iterated greedy algorithm for the S-labeling problem (Q6164608) (← links)