Enumeration technique for set covering problems: a combinatorial approach (Q5756413): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1369002
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Ratnesh Rajan Saxena / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/09720502.2006.10700454 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2094438744 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:44, 26 June 2024

scientific article; zbMATH DE number 5187076
Language Label Description Also known as
English
Enumeration technique for set covering problems: a combinatorial approach
scientific article; zbMATH DE number 5187076

    Statements

    Enumeration technique for set covering problems: a combinatorial approach (English)
    0 references
    4 September 2007
    0 references
    integer programming problems
    0 references
    multi-objective programming
    0 references
    combinatroics
    0 references

    Identifiers