The biobjective minimum-cost perfect matching problem and Chinese postman problem.
Miguel A. PozoJusto PuertoIgnacio RoldánPublished in: Int. Trans. Oper. Res. (2024)
Keyphrases
- minimum cost
- minimum cost flow
- polynomially solvable
- bi objective
- np hard
- approximation algorithms
- network flow
- spanning tree
- network flow problem
- efficient solutions
- shortest path algorithm
- multi objective
- undirected graph
- graph matching
- network design
- special case
- set covering problem
- multiple objectives
- neural network
- multi objective optimization
- ant colony optimization
- random walk
- np complete
- genetic algorithm