Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Penalty for zero–one integer equivalent problem (1982)
    Springer
    Mathematical programming 24 (1982), S. 229-232 
    Details
    ISSN: 1436-4646
    Keywords: Integer Programming ; Global Minimum ; Concave Quadratic Programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The equivalence of zero–one integer programming and a concave quadratic penalty function problem has been shown by Raghavachari, for a sufficiently large value of the penalty. A lower bound for this penalty is obtained here, which in specific cases cannot be reduced.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01585106
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...