CORE
CO
nnecting
RE
positories
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
Research partnership
About
About
About us
Our mission
Team
Blog
FAQs
Contact us
Community governance
Governance
Advisory Board
Board of supporters
Research network
Innovations
Our research
Labs
Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities
Authors
Andrea Lodi
Anily S.
+6 more
Even G.
Garey M.
Maxim Sviridenko
Nemhauser G.
Pochet Y.
Retsef Levi
Publication date
Publisher
'Institute for Operations Research and the Management Sciences (INFORMS)'
Doi
Cite
Abstract
Abstract is not available.
Similar works
Full text
Available Versions
Crossref
See this paper in CORE
Go to the repository landing page
Download from data provider
Last time updated on 01/04/2019