Polyhedral studies for minimum‐span graph labelling with integer distance constraints (Q5438551): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Models and solution techniques for frequency assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generation of lower bounds for minimum span frequency assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the span \(d\)-walks to compute optimum frequency assignments. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the monotonization of polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Frequency assignment in cellular phone networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the graph coloring polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Channel loading in private mobile radio networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalised graph colouring by a hybrid of local search and constraint programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(T\)-colorings of graphs: recent results and open problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for the frequency assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving heuristics for the frequency assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characteristics of good meta-heuristic algorithms for the frequency assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4242956 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimising channel assignments for private mobile radio networks in the UHF 2 band / rank
 
Normal rank
Property / cites work
 
Property / cites work: A channel assignment problem for optical networks modelled by Cayley graphs / rank
 
Normal rank

Latest revision as of 15:53, 27 June 2024

scientific article; zbMATH DE number 5229711
Language Label Description Also known as
English
Polyhedral studies for minimum‐span graph labelling with integer distance constraints
scientific article; zbMATH DE number 5229711

    Statements

    Polyhedral studies for minimum‐span graph labelling with integer distance constraints (English)
    0 references
    0 references
    24 January 2008
    0 references
    0 references
    0 references