Gamma deployment problem in grids: hardness and new integer linear programming formulation (Q6069923): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1111/itor.12759 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2993147459 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126622815 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-page book embeddings of 4-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rectilinear Steiner Tree Problem is $NP$-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton Paths in Grid Graphs / rank
 
Normal rank

Latest revision as of 11:20, 19 August 2024

scientific article; zbMATH DE number 7767653
Language Label Description Also known as
English
Gamma deployment problem in grids: hardness and new integer linear programming formulation
scientific article; zbMATH DE number 7767653

    Statements

    Gamma deployment problem in grids: hardness and new integer linear programming formulation (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 November 2023
    0 references
    0 references
    gamma deployment
    0 references
    complexity
    0 references
    integer linear programming
    0 references
    0 references
    0 references