On provably best construction heuristics for hard combinatorial optimization problems-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

On provably best construction heuristics for hard combinatorial optimization problems

Published:2015-07-01 Issue:3 Volume:67 Page:238-245
ISSN:0028-3045
Container-title:Networks
language:en
Short-container-title:NETWORKS

Author:

Kahruman-Anderoglu Sera¹,Buchanan Austin¹,Butenko Sergiy¹,Prokopyev Oleg A.²

Affiliation:

1. Department of Industrial and Systems Engineering; Texas A&M University; College Station Texas

2. Department of Industrial Engineering; University of Pittsburgh; Pittsburgh Pennsylvania

Funder

AFRL Mathematical Modeling and Optimization Institute

AFOSR

US Air Force Summer Faculty Fellowship

Publisher

Wiley

Subject

Computer Networks and Communications,Hardware and Architecture,Information Systems,Software

Link

http://onlinelibrary.wiley.com/wol1/doi/10.1002/net.21620/fullpdf

Reference52 articles.

1. Novel approaches for analyzing biological networks;Balasundaram;J Combin Optim,2005

2. Metaheuristics in combinatorial optimization: Overview and conceptual comparison;Blum;ACM Comput Surv,2003

3. Heuristics for finding k-clubs in an undirected graph;Bourjolly;Comput Oper Res,2000

4. An exact algorithm for the maximum k-club problem in an undirected graph;Bourjolly;Eur J Oper Res,2002

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs;European Journal of Operational Research;2022-02

2. An investigation of latency prediction for NoC-based communication architectures using machine learning techniques;The Journal of Supercomputing;2019-08-19

3. The Maximum Clique and Vertex Coloring;Handbook of Heuristics;2018

4. The Maximum Clique and Vertex Coloring;Handbook of Heuristics;2018

5. On biconnected and fragile subgraphs of low diameter;European Journal of Operational Research;2017-12

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3