SAT and IP based algorithms for magic labeling including a complete search for total magic labelings (Q2018542): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q60692221, #quickstatements; #temporary_batch_1712443714953
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Magic Labelings on Cycles and Wheels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numbered complete graphs, unusual rulers, and assorted applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Totally magic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplifying Pseudo-Boolean Constraints in Residual Number Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic survey of graph labeling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3184604 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SAT and IP Based Algorithms for Magic Labeling with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Algorithm for and Phase Transitions of the Directed Hamiltonian Cycle Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools and Algorithms for the Construction and Analysis of Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Magic labeling in graphs: Bounds, complexity, and an application to a variant of TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boosting haplotype inference with local search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4537240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4795895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4804900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(k\)-minimum and \(m\)-minimum edge-magic injections of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compiling finite domain constraints to SAT with<tt>BEE</tt> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean Equi-propagation for Concise and Efficient SAT Encodings of Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: SAT problems with chains of dependent variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4862899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming. Foundations and extensions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723258 / rank
 
Normal rank

Revision as of 22:04, 9 July 2024

scientific article
Language Label Description Also known as
English
SAT and IP based algorithms for magic labeling including a complete search for total magic labelings
scientific article

    Statements

    SAT and IP based algorithms for magic labeling including a complete search for total magic labelings (English)
    0 references
    0 references
    0 references
    24 March 2015
    0 references
    Boolean satisfiability
    0 references
    integer programming
    0 references
    magic labeling
    0 references
    0 references
    0 references

    Identifiers

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