"A branch-and-cut algorithm for the multi-vehicle traveling purchaser ..."

Daniele Manerba, Renata Mansini (2015)

> Home

Details and statistics

DOI: 10.1002/NET.21588

access: closed

type: Journal Article

metadata version: 2019-12-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/networks/ManerbaM15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/ManerbaM15
Daniele Manerba, Renata Mansini:
A branch-and-cut algorithm for the multi-vehicle traveling purchaser problem with pairwise incompatibility constraints. Networks 65(2): 139-154 (2015)

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.