Eiselt, Horst A.; Laporte, Gilbert Combinatorial optimization problems with soft and hard requirements. (English) Zbl 0626.90061 J. Oper. Res. Soc. 38, 785-795 (1987). The authors describe a heuristic principle for the solution of an important class of problems. Using real-world examples, it is then shown how some difficult combinatorial problems are modelled and solved by the suggested principle. In one case, a detailed discussion of the implementation of the solution is also provided. Cited in 13 Documents MSC: 90C10 Integer programming 90C31 Sensitivity, stability, parametric optimization 65K05 Numerical mathematical programming methods 90B35 Deterministic scheduling theory in operations research 90C27 Combinatorial optimization Keywords:heuristics; multiobjective optimization; resource allocation; scheduling PDFBibTeX XMLCite \textit{H. A. Eiselt} and \textit{G. Laporte}, J. Oper. Res. Soc. 38, 785--795 (1987; Zbl 0626.90061) Full Text: DOI