Counting and enumerating independent sets with applications to combinatorial optimization problems-Reference-Cited by-同舟云学术

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

Counting and enumerating independent sets with applications to combinatorial optimization problems

Published:2019-12-17 Issue:3 Volume:91 Page:439-463
ISSN:1432-2994
Container-title:Mathematical Methods of Operations Research
language:en
Short-container-title:Math Meth Oper Res

Author:

Gurski Frank,Rehs Carolin

Funder

Deutsche Forschungsgemeinschaft

Publisher

Springer Science and Business Media LLC

Subject

Management Science and Operations Research,General Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/s00186-019-00696-4.pdf

Reference25 articles.

1. Brandstädt A (1996) Partitions of graphs into one or two independent sets and cliques. Discrete Math 152:47–54

2. Caprara A, Lodi A, Rizzi R (2004) On $d$-threshold graphs and $d$-dimensional bin packing. Networks 44(4):266–280

3. Chvátal V, Hammer PL (1973) Set-packing and threshold graphs. In: Technical report CORR 73–21. Computer Science Department, University of Waterloo

4. Chvátal V, Hammer PL (1977) Aggregation of inequalities in integer programming. Ann Discrete Math 1:145–162

5. D’Ambrosio C, Furini F, Monaci M, Traversi E (2018) On the product knapsack problem. Optim Lett 12(4):691–712

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

1. Counting kernels in directed graphs with arbitrary orientations;Discrete Applied Mathematics;2024-10

2. Neural Maximum Independent Set;Communications in Computer and Information Science;2021

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP