scientific article; zbMATH DE number 5010630
From MaRDI portal
Publication:3374248
zbMATH Open1098.90057MaRDI QIDQ3374248FDOQ3374248
Publication date: 9 March 2006
Title of this publication is not available (Why is that?)
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
Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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)
