"The Time Dependent Traveling Salesman Problem: Polyhedra and ..."

Hernán G. Abeledo et al. (2010)

> Home

Details and statistics

DOI: 10.1007/978-3-642-13193-6_18

access: closed

type: Conference or Workshop Paper

metadata version: 2024-10-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/wea/AbeledoFPU10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wea/AbeledoFPU10
Hernán G. Abeledo, Ricardo Fukasawa, Artur Alves Pessoa, Eduardo Uchoa:
The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm. SEA 2010: 202-213

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.