Skip to main content
SpringerLink
Log in

Reformulating Combinatorial Optimization as Constraint Satisfaction

  • Conference paper
  • First Online:
Abstraction, Reformulation, and Approximation (SARA 2002)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2371))

  • 808 Accesses

Abstract

I am currently a third year graduate (PhD) student in the Computer Science Department of Stanford University working in the Artificial Intelligence areas of Planning, Scheduling, Diagnosis, Hybrid Systems and Constraint Satisfaction.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Kumar, T. K. S. and Dearden, R. 2002. The Oracular Constraints Method. Proceedings of the Fifth International Symposium on Abstraction Reformulation and Approximation (SARA 2002).

    Google Scholar 

  2. Kurien, J. and Nayak, P. P. 2000. Back to the Future for Consistency-Based Trajectory Tracking. Proceedings of the Seventeenth National Conference on Artificial Intelligence (AAAI 2000).

    Google Scholar 

  3. Leighton, T., Makedon, F., Plotkin, S., Stein, C., Tardos, E. and Tragoudas, S. 1991. Fast Approximation Algorithms for Multicommodity Flow Problem. In Proceedings of the 23rd ACM Symposium on the Theory of Computing, pages 101–111, May 1991.

    Google Scholar 

  4. Plotkin, S., Shmoys, D. and Tardos, E. 1995. Fast Approximation Algorithms for Fractional Packing and Covering Problems. Math of Oper. Research, 20(2):257–301, 1995.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Knowledge Systems Laboratory, Stanford University, USA

    T. K. Satish Kumar

Authors
  1. T. K. Satish Kumar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. College of Computing, Georgia Institute of Technology, 801 Atlantic Dr NW, Atlanta, GA, 30332-0280, USA

    Sven Koenig

  2. Department of Computing Science, Universtity of Alberta, 2-21 Athabasca Hall, Edmonton, Alberta, T6G 2E8, Canada

    Robert C. Holte

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kumar, T.K.S. (2002). Reformulating Combinatorial Optimization as Constraint Satisfaction. In: Koenig, S., Holte, R.C. (eds) Abstraction, Reformulation, and Approximation. SARA 2002. Lecture Notes in Computer Science(), vol 2371. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45622-8_33

Download citation

  • DOI: https://doi.org/10.1007/3-540-45622-8_33

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45622-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation