A branch-and-cut algorithm for a vehicle routing problem with capacity and time constraints (1997)
- Authors:
- Autor USP: FERREIRA, CARLOS EDUARDO - IME
- Unidade: IME
- Assunto: PROGRAMAÇÃO INTEIRA E FLUXOS EM REDE
- Language: Inglês
- Imprenta:
-
ABNT
FERREIRA, Carlos Alberto e LOPARIC, Marko. A branch-and-cut algorithm for a vehicle routing problem with capacity and time constraints. . São Paulo: IME-USP. Disponível em: https://repositorio.usp.br/directbitstream/7121bf05-5fde-4c02-8c7b-bf8a04efe128/975467.pdf. Acesso em: 26 set. 2024. , 1997 -
APA
Ferreira, C. A., & Loparic, M. (1997). A branch-and-cut algorithm for a vehicle routing problem with capacity and time constraints. São Paulo: IME-USP. Recuperado de https://repositorio.usp.br/directbitstream/7121bf05-5fde-4c02-8c7b-bf8a04efe128/975467.pdf -
NLM
Ferreira CA, Loparic M. A branch-and-cut algorithm for a vehicle routing problem with capacity and time constraints [Internet]. 1997 ;[citado 2024 set. 26 ] Available from: https://repositorio.usp.br/directbitstream/7121bf05-5fde-4c02-8c7b-bf8a04efe128/975467.pdf -
Vancouver
Ferreira CA, Loparic M. A branch-and-cut algorithm for a vehicle routing problem with capacity and time constraints [Internet]. 1997 ;[citado 2024 set. 26 ] Available from: https://repositorio.usp.br/directbitstream/7121bf05-5fde-4c02-8c7b-bf8a04efe128/975467.pdf - A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem
- A PTAS for the metric case of the optimum weighted source–destination communication spanning tree problem
- Some formulations for the group Steiner tree problem
- Decomposing matrices into blocks
- Some integer programs arising in the design of main frame computers
- PTAS’s for some metric p-source communication spanning tree problems
- Syntenic global alignment and its application to the gene prediction problem
- The node capacitated graph pertitioning problem: a computational study
- The biclique k-clustering problem in bipartite graphs and its application in bioinformatics
- A dynamic programming algorithm for the tree mapping problem
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 | 975467.pdf | Direct link |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
