A network relaxation based enumeration algorithm for set partitioning-Reference-Cited by-同舟云学术

A network relaxation based enumeration algorithm for set partitioning

Published:1989-01 Issue:1 Volume:38 Page:76-85
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Ali Agha Iqbal,Thiagarajan Hemalatha

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference19 articles.

1. Realizable binary and ternary matrices: An algorithmic development;Ali,1986

2. Algorithms for finding network substructure in binary and ternary matrices;Ali,1986

3. Dual simplex based reoptimization procedures for network problems;Ali,1986

4. A note on some computationally difficult set covering problems;Avis;Mathematical programming,1980

5. Set partitioning—A survey;Balas,1979

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

1. An Adaptive Feasible and Infeasible Search Algorithm for Solving the Set Covering Problem;Advances in Natural Computation, Fuzzy Systems and Knowledge Discovery;2021

2. The matching relaxation for a class of generalized set partitioning problems;Discrete Applied Mathematics;2019-01

3. Solving Set Covering Problem with Fireworks Explosion;Computational Science and Its Applications – ICCSA 2016;2016

4. Binary Harmony Search Algorithm for Solving Set-Covering Problem;Trends in Applied Knowledge-Based Systems and Data Science;2016

5. Cat Swarm Optimization with Different Binarization Methods for Solving Set Covering Problems;Advances in Intelligent Systems and Computing;2016