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: COMBINATÓRIA
- Language: Inglês
- Imprenta:
-
ABNT
FERREIRA, Carlos Alberto; LOPARIC, Marko. A branch-and-cut algorithm for a vehicle routing problem with capacity and time constraints. [S.l: s.n.], 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. -
NLM
Ferreira CA, Loparic M. A branch-and-cut algorithm for a vehicle routing problem with capacity and time constraints. 1997 ; -
Vancouver
Ferreira CA, Loparic M. A branch-and-cut algorithm for a vehicle routing problem with capacity and time constraints. 1997 ; - Escalonamento em sistemas de produção: um estudo de caso
- Solving the maximum edge biclique packing problem on unbalanced bipartite graphs
- Advances in bioinformatics and computational biology
- Some formulations for the group steiner tree problem
- Formulations and valid inequalities for the node capacitated graph partitioning problem
- A min–max relation in flowgraphs and some applications
- 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
- Minimum ratio cover of matrix columns by extreme rays of its induced cone
- The node capacitated graph pertitioning problem: a computational study
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
