Roman domination problem with uncertain positioning and deployment costs
From MaRDI portal
Publication:781325
DOI10.1007/s00500-019-03811-zzbMath1436.90144OpenAlexW2912627895WikidataQ128421040 ScholiaQ128421040MaRDI QIDQ781325
Publication date: 16 July 2020
Published in: Soft Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00500-019-03811-z
integer linear programminguncertainty theoryuncertain variablepositioning and deployment costsRoman-dominating set problem
Programming involving graphs or networks (90C35) Integer programming (90C10) Linear programming (90C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (2)
Special issue on decision making and uncertainty ⋮ Providing an uncertain model for evaluating the performance of a basic two-stage system
Cites Work
- Unnamed Item
- Unnamed Item
- Roman domination number of the Cartesian products of paths and cycles
- Upper bounds on Roman domination numbers of graphs
- A novel DEA model based on uncertainty theory
- Uncertain data envelopment analysis with imprecisely observed inputs and outputs
- Uncertain weighted dominating set: a prototype application on natural disaster relief management
- Data envelopment analysis with uncertain inputs and outputs
- Theory and practice of uncertain programming.
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Extremal Problems for Roman Domination
- Improved mixed integer linear programing formulations for roman domination problem
- Uncertainty theory
- Uncertainty theory
This page was built for publication: Roman domination problem with uncertain positioning and deployment costs
