CORE
🇺🇦Â
 make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Set covering algorithms using cutting planes, heuristics, and subgradient optimization : a computational study
Authors
Andrew Ho (5457842)
Carnegie Mellon UniversityDesign Research Center (5355980)
Egon Balas (5455712)
Publication date
30 June 2018
Publisher
Doi
Cite
Abstract
Tepper School of Busines
Similar works
Full text
Available Versions
KiltHub
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:figshare.com:article/67079...
Last time updated on 26/04/2020