首页    期刊浏览 2024年11月15日 星期五
登录注册

文章基本信息

  • 标题:On some interconnections between combinatorial optimization and extremal graph theory
  • 本地全文:下载
  • 作者:Cvetković Dragoš M. ; Hansen Pierre ; Kovačević-Vujčić Vera V.
  • 期刊名称:Yugoslav Journal of Operations Research
  • 印刷版ISSN:0354-0243
  • 电子版ISSN:1820-743X
  • 出版年度:2004
  • 卷号:14
  • 期号:2
  • 页码:147-154
  • DOI:10.2298/YJOR0402147C
  • 出版社:Faculty of Organizational Sciences, Belgrade, Mihajlo Pupin Institute, Belgrade, Economics Institute, Belgrade, Faculty of Transport and Traffic Engineering, Belgrade, Faculty of Mechanical Engineering, Belgrade
  • 摘要:

    The uniting feature of combinatorial optimization and extremal graph theory is that in both areas one should find extrema of a function defined in most cases on a finite set. While in combinatorial optimization the point is in developing efficient algorithms and heuristics for solving specified types of problems, the extremal graph theory deals with finding bounds for various graph invariants under some constraints and with constructing extremal graphs. We analyze by examples some interconnections and interactions of the two theories and propose some conclusions.

  • 关键词:combinatorial optimization; extremal graph theory; variable neighborhood search; mathematical programming.
国家哲学社会科学文献中心版权所有