scientific article; zbMATH DE number 6027052
From MaRDI portal
Publication:5389837
zbMath1249.05053MaRDI QIDQ5389837
Štefan Berežný, Vladimír Lacko
Publication date: 23 April 2012
Full work available at URL: https://eudml.org/doc/33771
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Trees (05C05) Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (6)
The balanced traveling salesman problem ⋮ The weak robustness of interval matrices in max-plus algebra ⋮ The robustness of interval matrices in max-plus algebra ⋮ Exact algorithms for the equitable traveling salesman problem ⋮ The quadratic balanced optimization problem ⋮ On the weak robustness of interval fuzzy matrices
Cites Work
- Color constrained combinatorial optimization problems
- Traveling salesman problem under categorization
- Minimum perfect bipartite matchings and spanning trees under categorization
- Categorized bottleneck-minisum path problems on networks
- Balanced problems on graphs with categorization of edges
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: