Synapse
⌘+K
Synapse
PulseExploreClubsResearchersJournals
Instagram
HomeClubsExplore
July 1, 1971Management Science

An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex Constraints

View Full Paper
Ask AI
Bookmark
Share

Authors

RSRichard M. SolandGeorge Washington University

Discussion

Loading...

Member takes

Implication

Key Points

Key points are not available for this paper at this time.

Cite This Study

Richard M. Soland (1971) studied this question.

synapsesocial.com/papers/6a63206550e2b8a4ef6a97b4https://doi.org/10.1287/mnsc.17.11.759
View Full Paper
Ask AI
Bookmark
Share

Also Consider

Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1An Algorithm for Separable Nonconvex Programming Problems1969 · 404 citations
  2. 2Optimum Seeking with Branch and Bound1966 · 112 citations
  3. 3Branch-and-Bound Methods: A Survey1966 · 2,009 citations