On provably best construction heuristics for hard combinatorial optimization problems

@article{KahrumanAnderoglu2016OnPB,
  title={On provably best construction heuristics for hard combinatorial optimization problems},
  author={Sera Kahruman-Anderoglu and Austin Buchanan and Sergiy Butenko and Oleg A. Prokopyev},
  journal={Networks},
  year={2016},
  volume={67},
  pages={238-245}
}
In this paper, a heuristic is said to be provably best if, assuming P 6= NP, no other heuristic always finds a better solution (when one exists). This extends the usual notion of “best possible” approximation algorithms to include a larger class of heuristics. We illustrate the idea on several problems that are somewhat stylized versions of real-life network optimization problems, including the maximum clique, maximum k-club, minimum (connected) dominating set, and minimum vertex coloring… CONTINUE READING
BETA

References

Publications referenced by this paper.
SHOWING 1-10 OF 53 REFERENCES

Distance-based clique relaxations in networks: s-clique and s-club,” Models, algorithms, and technologies for network analysis

  • S. Shahinpour, S. Butenko
  • Vol. 59 of Springer Proceedings in Mathematics…
  • 2013
2 Excerpts

Similar Papers

Loading similar papers…