Combining Heuristics for Configuration Problems Using Answer Set Programming (Q3449221): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-23264-5_32 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2394499116 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization Methods for the Partner Units Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3011298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-Based Program Rewriting for Solving Configuration Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search combinators / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments / rank
 
Normal rank

Latest revision as of 01:02, 11 July 2024

scientific article
Language Label Description Also known as
English
Combining Heuristics for Configuration Problems Using Answer Set Programming
scientific article

    Statements

    Combining Heuristics for Configuration Problems Using Answer Set Programming (English)
    0 references
    0 references
    0 references
    0 references
    4 November 2015
    0 references
    configuration problem
    0 references
    heuristics
    0 references
    answer set programming
    0 references

    Identifiers