Algorithmic expedients for the \(S\)-labeling problem (Q2003435): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2019.04.014 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2972318496 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1909.04463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching rules revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic complexity of proper labeling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP with path relinking heuristics for the antibandwidth problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dual-Based Procedure for Uncapacitated Facility Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of the S-Labeling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(S\)-\textsc{labeling} problem: an algorithmic tour / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the S-Labeling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph labeling and radio channel assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph distance‐dependent labeling related to code assignment in computer networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mapping the genome / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search for the cyclic bandwidth problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing of (0, 1)-matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4254875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual ascent approach for steiner tree problems on a directed graph / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128116087 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2019.04.014 / rank
 
Normal rank

Latest revision as of 17:47, 16 December 2024

scientific article
Language Label Description Also known as
English
Algorithmic expedients for the \(S\)-labeling problem
scientific article

    Statements

    Algorithmic expedients for the \(S\)-labeling problem (English)
    0 references
    0 references
    8 July 2019
    0 references
    graph labeling
    0 references
    branch-and-cut
    0 references
    Lagrangian relaxation
    0 references
    constraint programming
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references