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
Resource-robust valid inequalities for set covering and set partitioning models
Authors
K. (Kevin) Dalmeijer
Y.N. (Ymro) Hoogendoorn
Publication date
12 January 2021
Publisher
Abstract
For a variety of routing and scheduling problems in aviation, shipping, rail, and road transportation, the state-of-the-art solution approach is to model the prob- lem as a set coverin
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Erasmus University Digital Repository
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:repub.eur.nl:134553
Last time updated on 16/04/2021