Integer linear models with a polynomial number of variables and constraints for some classical combinatorial optimization problems

Integer linear models with a polynomial number of variables and constraints for some classical combinatorial optimization problems

We present integer linear models with a polynomial number of variables and constraints for combinatorial optimization problems in graphs: optimum elementary cycles, optimum elementary paths and optimum tree problems.<br>Apresentamos modelos lineares inteiros com um número polinomial de variáve...

Full description

Bibliographic Details
Main Authors: Nelson Maculan, Gérard Plateau, Abdel Lisser
Format: Article
Language:English
Published: Sociedade Brasileira de Pesquisa Operacional 2003-01-01
Series:Pesquisa Operacional
Subjects:
modelos de problemas de otimização combinatória
otimização em grafos
caracterização de subgrafos conexos
modeling combinatorial optimization problems
optimization in graphs
characterization of connected subgraphs
Online Access:http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382003000100012

Internet

http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382003000100012

Similar Items