Skip to main content
SpringerLink
Log in

Flexible-attribute problems

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

Problems with significant input-data uncertainty are very common in practical situations. One approach to dealing with this uncertainty is called scenario planning, where the data uncertainty is represented with scenarios. A scenario represents a potential realization of the important parameters of the problem.

In this paper we present a new approach to coping with data uncertainty, called the flexibility approach. Here a problem is described as a set of interconnected simple scenarios. The idea is to find a solution for each scenario such that, after a change in scenario, transforming from one solution to the other one is not expensive.

We define two versions of flexibility and hence two versions of the problem, which are called the sum-flexible-attribute problem and the max-flexible-attribute problem. For both problems we prove the \(\ensuremath{\mathcal{NP}}\) -hardness as well as the non-approximability. We present polynomial time algorithms for solving the two problems to optimality on trees. Finally, we discuss the possible applications and generalizations of the new approach.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Averbakh, I., Berman, O.: Algorithms for robust 1-center problem on a tree. Eur. J. Oper. Res. 123, 292–302 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  2. Averbakh, I., Berman, O.: Minimax regret p-center location on a network with demand uncertainty. Location Sci. 5, 247–254 (1997)

    Article  MATH  Google Scholar 

  3. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Berlin (1999)

    MATH  Google Scholar 

  4. Baker, K.L., Franz, A.M., Jordan, P.W.: Coping with ambiguity in knowledge-based natural language analysis. In: Proceedings of FLAIRS-94 (1994)

  5. Bhatia, R., Guha, S., Khuller, S., Sussmann, Y.J.: Facility location with dynamic distance functions. J. Comb. Optim. 2, 199–217 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  6. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)

    MATH  Google Scholar 

  7. Dagan, I., Itai, A.: Word sense disambiguation using a second language monolingual corpus. Comput. Linguist. 20(4), 563–596 (1994)

    Google Scholar 

  8. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)

    MATH  Google Scholar 

  9. Hochbaum, D.S., Pathria, A.: Locating centers in a dynamically changing network, and related problems. Location Sci. 6, 243–256 (1998)

    Article  Google Scholar 

  10. Kouvelis, P., Yu, G.: Robust Discrete Optimization and Its Applications. Kluwer Academic, Boston (1997)

    MATH  Google Scholar 

  11. Mahjoub, A., Mihelič, J., Rapine, C., Robič, B.: k-center problem with uncertainty: flexible approach. In: International Workshop on Discrete Optimization Methods in Production and Logistics, Omsk–Irkutsk, Russia (2004)

  12. Mihelič, J., Mahjoub, A., Rapine, C., Robič, B.: Two-stage flexible-choice problems under uncertainty (submitted)

  13. Serra, D., Marianov, V.: The location of emergency services in changing network: the case of Barcelona. In: Seventh International Symposium on Locational Decisions, Edmonton, Canada (1996)

  14. Snyder, L.V.: Facility location under uncertainty: a review. Dept. of Industrial and Systems Engineering, Lehigh University, 04T-015 (2004)

Download references

Author information

Authors and Affiliations

  1. Faculty of Computer and Information Science, University of Ljubljana, Ljubljana, Slovenia

    Jurij Mihelič & Borut Robič

Authors
  1. Jurij Mihelič
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Borut Robič
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jurij Mihelič.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mihelič, J., Robič, B. Flexible-attribute problems. Comput Optim Appl 47, 553–566 (2010). https://doi.org/10.1007/s10589-009-9234-9

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-009-9234-9

Keywords

Search

Navigation