Innovative cost allocation strategies for the shortest route relaxation of the set covering problem

MaRDI QIDQ2907709zbMATH OpenFDO

Authors Bahar Obed Ali, Farhad Djannaty

Publication date 11 September 2012

Published in International Journal of Contemporary Mathematical Sciences (Search for Journal in Brave)

Full work available at URL http://www.m-hikari.com/ijcms/ijcms-2012/9-12-2012/index.html

zbMATH Keywords

set covering problemshortest routegraph theoretic relaxation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Some useful cost allocation strategies for the shortes route relaxation of the set covering problem
• Graph theoretic relaxations of set covering and set partitioning problems
• Network based heuristics for the set covering problem
• RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
• Solution of Set-Covering and Set-Partitioning Problems Using Assignment Relaxations

Cited in

(3)

• Some useful cost allocation strategies for the shortes route relaxation of the set covering problem
• Network based heuristics for the set covering problem
• Solution of Set-Covering and Set-Partitioning Problems Using Assignment Relaxations

This page was built for publication: Innovative cost allocation strategies for the shortest route relaxation of the set covering problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2907709)