Pages that link to "Item:Q4786789"

The following pages link to Frequency planning and ramifications of coloring (Q4786789):

Displaying 16 items.

• Inverse chromatic number problems in interval and permutation graphs (Q319198) (← links)
• Algorithms for the generalized weighted frequency assignment problem (Q339680) (← links)
• SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints (Q499161) (← links)
• BCH codes and distance multi- or fractional colorings in hypercubes asymptotically (Q868374) (← links)
• Greedy \(T\)-colorings of graphs (Q1024485) (← links)
• On the structure of (even hole, kite)-free graphs (Q1756042) (← links)
• Inverse interval scheduling via reduction on a single machine (Q2158006) (← links)
• Regular pattern-free coloring (Q2172395) (← links)
• On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming (Q2220656) (← links)
• A novel approach for solving semidefinite programs (Q2336591) (← links)
• On some applications of the selective graph coloring problem (Q2629634) (← links)
• An Efficient Inexact ABCD Method for Least Squares Semidefinite Programming (Q2805705) (← links)
• An Exact Site Availability Approach to Modeling the D-FAP (Q2883541) (← links)
• Three tabu search methods for the MI-FAP applied to 802.11 networks (Q3163671) (← links)
• Graphs and Algorithms in Communication Networks on Seven League Boots (Q3404458) (← links)
• Mathematical Optimization Models for WLAN Planning (Q3404474) (← links)