Resolution Branch and Bound and an Application: The Maximum Weighted Stable Set Problem-Reference-Cited by-同舟云学术

Resolution Branch and Bound and an Application: The Maximum Weighted Stable Set Problem

Published:2007-10 Issue:5 Volume:55 Page:932-948
ISSN:0030-364X
Container-title:Operations Research
language:en
Short-container-title:Operations Research

Author:

Avenali Alessandro

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Subject

Management Science and Operations Research,Computer Science Applications

Link

https://pubsonline.informs.org/doi/pdf/10.1287/opre.1070.0397

Reference18 articles.

1. Finding a Maximum Clique in an Arbitrary Graph

2. Resolution search

3. Combining satisfiability techniques from AI and OR

4. Gaschnig J. Experimental case studies of backtrack vs. Waltz-type vs. new algorithms for satisficing assignment problemsProc. Second Conf. Canadian Soc. Computational Stud. Intelligence(1978) Toronto, Ontario, Canada268277

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

1. KEY-COST DRIVERS SELECTION IN LOCAL PUBLIC BUS TRANSPORT SERVICES THROUGH MACHINE LEARNING;WIT Transactions on The Built Environment;2017-09-05

2. Indirect unstructured hex-dominant mesh generation using tetrahedra recombination;Computational Geosciences;2015-04-29

3. A mechanism for supporting collective innovation: the open contract-based challenge;Information Systems and e-Business Management;2012-12-09

4. A tutorial on branch and cut algorithms for the maximum stable set problem;International Transactions in Operational Research;2012-01

5. Information-based branching schemes for binary linear mixed integer problems;Mathematical Programming Computation;2009-12