Management Science Vol. 23 No. 12 1977
Procedures for Estimating Optimal Solution Values for Large Combinatorial Problems
Abstract
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.
- DOI
- 10.1287/mnsc.23.12.1273
- Volume
- 23
- Issue
- 12
- Pages
- 1273-1283
- Language
- en
- Sources
- bibtex:phds-export.bib crossref openalex