Polyhedral studies for minimum‐span graph labelling with integer distance constraints

DOI10.1111/J.1475-3995.2007.00577.XMaRDI QIDQ5438551zbMATH OpenOpenAlexFDO

Authors Vicky H. Mak

Publication date 24 January 2008

Published in International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/j.1475-3995.2007.00577.x

Mathematics Subject Classification ID

Integer programming (90C10) Programming involving graphs or networks (90C35)

Recommendations

• Cyclic labellings with constraints at two distances
• A polyhedral approach to the generalized minimum labeling spanning tree problem
• A polyhedral study of the diameter constrained minimum spanning tree problem
• Graph labeling and radio channel assignment
• Real Number Graph Labellings with Distance Conditions

Cites work

• \(T\)-colorings of graphs: recent results and open problems
• A channel assignment problem for optical networks modelled by Cayley graphs
• Bounds for the frequency assignment problem
• Channel loading in private mobile radio networks
• Characteristics of good meta-heuristic algorithms for the frequency assignment problem
• Facets of the graph coloring polytope
• Frequency assignment in cellular phone networks
• Generalised graph colouring by a hybrid of local search and constraint programming
• Generation of lower bounds for minimum span frequency assignment
• Graph labeling and radio channel assignment
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• Improving heuristics for the frequency assignment problem
• Minimizing the span \(d\)-walks to compute optimum frequency assignments.
• Models and solution techniques for frequency assignment problems
• Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network
• On the monotonization of polyhedra
• Optimising channel assignments for private mobile radio networks in the UHF 2 band

Cited in

(1)

• Facet-inducing inequalities and a cut-and-branch for the bandwidth coloring polytope based on the orientation model

Describes a project that uses

Uses Software

• CALMA

This page was built for publication: Polyhedral studies for minimum‐span graph labelling with integer distance constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5438551)