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
research
Letters
Authors
A. V. Donati
L. M. Gambardella
R. Montemanni
Publication date
1 January 2004
Publisher
Abstract
www.elsevier.com/locate/dsw A branch and bound algorithm for the robust shortest path problem with interval data
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Archivio istituzionale della ricerca - Università di Modena e Reggio Emilia
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:iris.unimore.it:11380/1176...
Last time updated on 15/05/2019
CiteSeerX
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:CiteSeerX.psu:10.1.1.5.673...
Last time updated on 22/10/2014
CiteSeerX
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:CiteSeerX.psu:10.1.1.84.18...
Last time updated on 22/10/2014
