A class of location, distribution and scheduling problems : modeling and solution methods
Year: 2018
Type: article
Abstract: Discusses the potential of set covering techniques. Illustrates problem formulation techniques on several important classes of real-world problems. Also describes a class of algorithms for solving set covering problems, based on cutting planes, heuristics and subgradient optimization
Source: KiltHub Repository
DOI: 10.1184/r1/6702827
Authors: Balas, Egon, Center., Carnegie Mellon University.Design Research
Institution: Carnegie Mellon University
Language: English
Field: Decision Sciences
Domain: Social Sciences
Open Access status: green
OpenAlex ID: W8638668
