Flexible-attribute problems

DOI10.1007/S10589-009-9234-9zbMATH Open1254.90274OpenAlexW2089529268MaRDI QIDQ616800FDOQ616800

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

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

zbMATH Keywords

algorithmsuncertaintyNP-hardflexibilityapproximability

Mathematics Subject Classification ID

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

Cites Work

• Introduction to algorithms
• Title not available (Why is that?)
• Robust discrete optimization and its applications
• Minimax regret p-center location on a network with demand uncertainty
• Title not available (Why is that?)
• Algorithms for the robust 1-center problem on a tree
• Two-stage flexible-choice problems under uncertainty
• Facility location with dynamic distance functions

Cited In (3)

• On the computational complexity of combinatorial flexibility problems
• Tilted inequalities and facets of the set covering polytope: a theoretical analysis
• 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)