Flexible-attribute problems

DOI10.1007/S10589-009-9234-9MaRDI QIDQ616800zbMATHOpenAlexFDO

Authors 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)

Recommendations

• Combinatorial flexibility problems and their computational complexity
• Flexible linear programming with fuzzy constraints
• Assignment problem with multiple attributes of criteria crisp, fuzzy and linguistic type data
• Formal Concept Analysis
• Optimization problems with flexible objectives: a general modeling approach and applications
• Interactive multiple objective programming subject to flexible constraints
• scientific article; zbMATH DE number 1894967

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1330033 (Why is no real title available?)
• Algorithms for the robust 1-center problem on a tree
• Facility location with dynamic distance functions
• Introduction to algorithms
• Minimax regret p-center location on a network with demand uncertainty
• Robust discrete optimization and its applications
• Two-stage flexible-choice problems under uncertainty

Cited in

(3)

• Tilted inequalities and facets of the set covering polytope: a theoretical analysis
• On the computational complexity of combinatorial flexibility problems
• Two-stage flexible-choice problems under uncertainty

This page was built for publication: Flexible-attribute problems

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