Skip to main content
SpringerLink
Log in

Discrete Optimization with Polynomially Detectable Boundaries and Restricted Level Sets

  • Conference paper
Book cover Combinatorial Optimization and Applications (COCOA 2010)

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

Abstract

The paper describes an optimization procedure for a class of discrete optimization problems which is defined by certain properties of the boundary of the feasible region and level sets of the objective function. It is shown that these properties are possessed, for example, by various scheduling problems, including a number of well-known NP-hard problems which play an important role in scheduling theory. For an important particular case the presented optimization procedure is compared with a version of the branch-and-bound algorithm by means of computational experiments.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Garey, M.R., Johnson, D.S.: Scheduling tasks with nonuniform deadlines on two processors. J. of ACM 23, 461–467 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  2. Lenstra, J.K., Rinnooy Kan, A.H.G.: Complexity of scheduling under precedence constraints. Oper. Res. 26, 22–35 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  3. Pinedo, M.: Scheduling: theory, algorithms, and systems, 3rd edn. Springer, Heidelberg (2008)

    MATH  Google Scholar 

  4. Ullman, J.D.: NP-complete scheduling problems. J. Comp. Syst. Sci. 10, 384–393 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  5. Zinder, Y.: The strength of priority algorithms. In: Proceedings, MISTA, pp. 531–537 (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Technology, P.O. Box 123, Sydney, Broadway, NSW, 2007, Australia

    Yakov Zinder & Julia Memar

  2. CSIRO, Private Bag 33, South Clayton, VIC, 3169, Australia

    Gaurav Singh

Authors
  1. Yakov Zinder
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Julia Memar
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gaurav Singh
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Texas at Dallas, 75080, Richardson, TX, USA

    Weili Wu  & Ovidiu Daescu  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zinder, Y., Memar, J., Singh, G. (2010). Discrete Optimization with Polynomially Detectable Boundaries and Restricted Level Sets. In: Wu, W., Daescu, O. (eds) Combinatorial Optimization and Applications. COCOA 2010. Lecture Notes in Computer Science, vol 6508. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17458-2_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-17458-2_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-17457-5

  • Online ISBN: 978-3-642-17458-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation