Prioritizing municipal lead mitigation projects as a relaxed knapsack optimization: a method and case study

DOI10.1111/itor.13212arXiv2201.09372OpenAlexW4298110615MaRDI QIDQ6080608

Unnamed Author

Publication date: 4 October 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2201.09372

zbMATH Keywords

decision support systemscombinatorial optimizationknapsack problemmathematical programmingdecision analysislead service line replacement

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Approximate Algorithms for the 0/1 Knapsack Problem
• Multicriteria decision making under uncertainty: a visual approach
• Applying software engineering techniques in the development and management of linear and integer programming applications
• Discrete-Variable Extremum Problems

This page was built for publication: Prioritizing municipal lead mitigation projects as a relaxed knapsack optimization: a method and case study