Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"A branch-price-and-cut algorithm for the min-max k-vehicle windy ..."

Enrique Benavent et al. (2014)

> Home

Details and statistics

DOI: 10.1002/NET.21520

access: closed

type: Journal Article

metadata version: 2022-01-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/networks/BenaventCDLPS14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/BenaventCDLPS14
Enrique Benavent, Angel Corberán, Guy Desaulniers, François Lessard, Isaac Plana, José M. Sanchis:
A branch-price-and-cut algorithm for the min-max k-vehicle windy rural postman problem. Networks 63(1): 34-45 (2014)

a service of

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.