
handle: 2292/20878
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eulerian and Hamiltonian graphs, Combinatorial optimization, multistage insertion formulation, 000, Analysis of algorithms and problem complexity, symmetric traveling salesman problem, nonadjacency testing, Symmetric Traveling Salesman Problem, Nonadjacency testing, Computational aspects related to convexity, Hamiltonian cycles, Theoretical Computer Science, Graph algorithms (graph-theoretic aspects), Flows in networks, Polyhedral combinatorics, branch-and-bound, branch-and-cut, Discrete Mathematics and Combinatorics, Multistage insertion formulation, Pedigree polytope, flows in networks, pedigree polytope
Eulerian and Hamiltonian graphs, Combinatorial optimization, multistage insertion formulation, 000, Analysis of algorithms and problem complexity, symmetric traveling salesman problem, nonadjacency testing, Symmetric Traveling Salesman Problem, Nonadjacency testing, Computational aspects related to convexity, Hamiltonian cycles, Theoretical Computer Science, Graph algorithms (graph-theoretic aspects), Flows in networks, Polyhedral combinatorics, branch-and-bound, branch-and-cut, Discrete Mathematics and Combinatorics, Multistage insertion formulation, Pedigree polytope, flows in networks, pedigree polytope
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 11 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
