Skip to main content
Springer Nature Link
Log in

Generalised Integer Programming Based on Logically Defined Relations

  • Conference paper
Mathematical Foundations of Computer Science 2006 (MFCS 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4162))

  • 1062 Accesses

Abstract

Many combinatorial optimisation problems can be modelled as integer linear programs. We consider a class of generalised integer programs where the constraints are allowed to be taken from a broader set of relations (instead of just being linear inequalities). The set of allowed relations is defined using a many-valued logic and the resulting class of relations have provably strong modelling properties. We give sufficient conditions for when such problems are polynomial-time solvable and we prove that they are APX-hard otherwise.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation. Springer, Heidelberg (1999)

    MATH  Google Scholar 

  2. Creignou, N., Hermann, M., Krokhin, A., Salzer, G.: Complexity of clausal constraints over chains (2006). To appear in: Theory of Computing Systems (2006), Preliminary version available from www.cis.syr.edu/~royer/lcc/LCC05

  3. Creignou, N., Khanna, S., Sudan, M.: Complexity Classifications of Boolean Constraint Satisfaction Problems. SIAM Monographs on Discrete Mathematics and Applications, vol. 7. SIAM, Philadelphia (2001)

    Book  MATH  Google Scholar 

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

    MATH  Google Scholar 

  5. J. Gil, À., Hermann, M., Salzer, G., Zanuttini, B.: Efficient algorithms for constraint description problems over finite totally ordered domains. In: Proceedings of Automated Reasoning, Second International Joint Conference (IJCAR 2004), pp. 244–258 (2004)

    Google Scholar 

  6. Hähnle, R.: Complexity of many-valued logics. In: Proceedings of the 31st IEEE International Symposium on Multiple-valued Logic (ISMVL 2001), pp. 137–148 (2001)

    Google Scholar 

  7. Hooker, J.N., Osorio, M.: Mixed logical-linear programming. Discrete Applied Mathematics 96-97, 395–442 (1999)

    Google Scholar 

  8. Jeavons, P.G., Cooper, M.C.: Tractable constraints on ordered domains. Artificial Intelligence 79, 327–339 (1996)

    Article  MathSciNet  Google Scholar 

  9. Jonsson, P.: Boolean constraint satisfaction: complexity results for optimization problems with arbitrary weights. Theoretical Computer Science 244(1-2), 189–203 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  10. Khanna, S., Sudan, M., Trevisan, L., Williamson, D.P.: The approximability of constraint satisfaction problems. SIAM J. Comput. 30(6), 1863–1920 (2000)

    Article  MathSciNet  Google Scholar 

  11. Ladner, R.E.: On the structure of polynomial time reducibility. Journal of the ACM 22(1), 155–171 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  12. Pöschel, R., Kalužnin, L.: Funktionen- und Relationenalgebren. DVW, Berlin (1979)

    Google Scholar 

  13. Schrijver, A.: A combinatorial algorithm minimizing submodular functions in polynomial time. Journal of Combinatorial Theory, ser. B 80, 346–355 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  14. Wolfman, S.A., Weld, D.S.: The LPSAT engine & its application to resource planning. In: Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI 1999), pp. 310–317 (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Information Science, Linköpings Universitet, S-581 83, Linköping, Sweden

    Peter Jonsson & Gustav Nordh

Authors
  1. Peter Jonsson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gustav Nordh
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Comenius University, Mlynská dolina, 84248, Bratislava, Slovakia

    Rastislav Královič

  2. Institute of Informatics, University of Warsaw, Poland

    Paweł Urzyczyn

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jonsson, P., Nordh, G. (2006). Generalised Integer Programming Based on Logically Defined Relations. In: Královič, R., Urzyczyn, P. (eds) Mathematical Foundations of Computer Science 2006. MFCS 2006. Lecture Notes in Computer Science, vol 4162. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11821069_48

Download citation

  • DOI: https://doi.org/10.1007/11821069_48

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-37791-7

  • Online ISBN: 978-3-540-37793-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation