Improving the performance of enumerative search methods. II: Computational experiments

DOI10.1016/0305-0548(95)00016-FzbMath0842.90086OpenAlexW2012603310MaRDI QIDQ1905078

James R. Evans, Martin S. Levy, Adam Fadlalla

Publication date: 16 January 1996

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(95)00016-f

zbMATH Keywords

branch and boundcomputational resultsstatistical analysismean tardiness job sequencing

Mathematics Subject Classification ID

Integer programming (90C10)

Uses Software

• SAS
• SAS/STAT

Cites Work

• Modeling and integer programming techniques applied to propositional calculus
• Resolution vs. cutting plane solution of inference problems: Some computational experience
• A greedy heuristic for the mean tardiness sequencing problem
• Future paths for integer programming and links to artificial intelligence
• Improving the performance of enumerative search methods. I: Exploiting structure and intelligence

This page was built for publication: Improving the performance of enumerative search methods. II: Computational experiments