Flexible-attribute problems

DOI10.1007/s10589-009-9234-9zbMath1254.90274OpenAlexW2089529268MaRDI QIDQ616800

Jurij Mihelič, Borut Robič

Publication date: 12 January 2011

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-009-9234-9

zbMATH Keywords

algorithmsuncertaintyNP-hardflexibilityapproximability

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Related Items (1)

Two-stage flexible-choice problems under uncertainty

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two-stage flexible-choice problems under uncertainty
• Facility location with dynamic distance functions
• Robust discrete optimization and its applications
• Algorithms for the robust 1-center problem on a tree
• Minimax regret p-center location on a network with demand uncertainty

This page was built for publication: Flexible-attribute problems