A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization-Reference-Cited by-同舟云学术

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

Published:2006-10 Issue:5 Volume:54 Page:847-858
ISSN:0030-364X
Container-title:Operations Research
language:en
Short-container-title:Operations Research

Author:

Keha Ahmet B.,de Farias Ismael R.,Nemhauser George L.

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Subject

Management Science and Operations Research,Computer Science Applications

Link

https://pubsonline.informs.org/doi/pdf/10.1287/opre.1060.0277

Reference15 articles.

1. Integer Programming

2. Beale E. L. M., Tomlin J. A., Lawrence J. Special facilities in a general mathematical programming system for nonconvex problems using ordered sets of variablesProc. Fifth Internat. Conf. on OR(1970) London, UKTavistock Publications447454

3. Models and Methods for Merge-in-Transit Operations

4. A family of inequalities for the generalized assignment polytope

5. A polyhedral study of the cardinality constrained knapsack problem

Cited by 67 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. New classes of Facets for complementarity knapsack problems;Discrete Applied Mathematics;2024-10

2. A Discussion on Non-Convex Optimization Problems Arising in Supply Chain Design and Finance;Advancement in Business Analytics Tools for Higher Financial Performance;2023-08-08

3. A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables;Optimization Letters;2023-03-02

4. Mixed-Integer Programming Formulations for Piecewise Linear Functions;Encyclopedia of Optimization;2022-09-23

5. Piecewise linear neural networks and deep learning;Nature Reviews Methods Primers;2022-06-09