Improving the performance of enumerative search methods. II: Computational experiments (Q1905078): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Future paths for integer programming and links to artificial intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution vs. cutting plane solution of inference problems: Some computational experience / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling and integer programming techniques applied to propositional calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: A greedy heuristic for the mean tardiness sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the performance of enumerative search methods. I: Exploiting structure and intelligence / rank
 
Normal rank

Latest revision as of 09:14, 24 May 2024

scientific article
Language Label Description Also known as
English
Improving the performance of enumerative search methods. II: Computational experiments
scientific article

    Statements

    Improving the performance of enumerative search methods. II: Computational experiments (English)
    0 references
    0 references
    0 references
    0 references
    16 January 1996
    0 references
    0 references
    branch and bound
    0 references
    mean tardiness job sequencing
    0 references
    computational results
    0 references
    statistical analysis
    0 references
    0 references
    0 references