An analysis of six greedy selection rules on a class of zero-one integer programming models

DOI<link itemprop=identifier href="https://doi.org/10.1002/1520-6750(199004)37:2<299::AID-NAV3220370208>3.0.CO;2-M" /><299::AID-NAV3220370208>3.0.CO;2-M 10.1002/1520-6750(199004)37:2<299::AID-NAV3220370208>3.0.CO;2-MzbMath0699.90074OpenAlexW2023310099MaRDI QIDQ3478264

G. Edward Fox, Christopher J. Nachtsheim

Publication date: 1990

Full work available at URL: https://doi.org/10.1002/1520-6750(199004)37:2<299::aid-nav3220370208>3.0.co;2-m

zbMATH Keywords

computational studygreedy heuristics

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Boolean programming (90C09)

Related Items (1)

Scheduling experiments on a nulear reactor using mixed integer programming

This page was built for publication: An analysis of six greedy selection rules on a class of zero-one integer programming models