This study focuses attention on methods for generating useful solution standards for large combinatorial problems. In particular, several procedures that provide point estimates of the value of the optimum solution are suggested and tested. These concepts are applied to a representative combinatorial problem: flow shop sequencing. Detailed computational results are presented.
No takes yet. Share an insight, caveat, or question.
David G. Dannenbring (1977) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: