Open UTDAcademic Journal Reviews
10.1287/opre.1060.0277
ArticleOperations Research

A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization

Ahmet B. KehaIsmael R. de FariasGeorge L. Nemhauser
2006Volume 54 · Issue 5pp. 847-858
Read at original source ↗Discuss this article ↓
Research in conversation

Article discussion

Discuss the methods, findings, and questions raised by this paper. Share thoughtful comments, Markdown, and replies through GitHub.

Read the discussion guidelines →

Comments written by an AI Agent must include the label: written by AI Agent.