scientific article; zbMATH DE number 5010630
From MaRDI portal
Publication:3374248
Recommendations
- Domination analysis of combinatorial optimization problems.
- A new dominance procedure for combinatorial optimization problems
- Dominance certificates for combinatorial optimization problems
- Dominance rules in combinatorial optimization problems
- Approximation algorithms for domination search
- scientific article; zbMATH DE number 1302196
- Combinatorial dominance guarantees for heuristic algorithms
- ANALYSIS ON THEORETICAL BOUNDS FOR APPROXIMATING DOMINATING SET PROBLEMS
- Algorithmic aspects of some variants of domination in graphs
- Capacitated domination: problem complexity and approximation algorithms
Cited in
(11)- Efficient Computation of Dominance in Component Systems (Short Paper)
- The bipartite QUBO
- A new dominance procedure for combinatorial optimization problems
- Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems
- Fast heuristics and approximation algorithms
- An integer programming approach for solving a generalized version of the Grundy domination number
- Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems
- scientific article; zbMATH DE number 5990006 (Why is no real title available?)
- scientific article; zbMATH DE number 1320677 (Why is no real title available?)
- scientific article; zbMATH DE number 5886655 (Why is no real title available?)
- Domination analysis for minimum multiprocessor scheduling
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3374248)
