Pure Cutting‐Plane Algorithms and their Convergence

Dinakar Gade; Simge Kucukyavuz

Pure Cutting‐Plane Algorithms and their Convergence

Industrial Engineering and Management Sciences

Research output: Chapter in Book/Report/Conference proceeding › Entry for encyclopedia/dictionary

Abstract

Cutting‐plane methods solve a mixed‐integer program (MIP) by iteratively adding a valid linear inequality that violates a fractional solution of a linear relaxation of the problem. This article surveys cutting‐plane algorithms for different subclasses of MIPs and addresses whether these algorithms converge to an optimal solution of MIP in finitely many steps.

Original language	English (US)
Title of host publication	Wiley Encyclopedia of Operations Research and Management Science
Editors	James J Cochran, Louis A Cox Jr, Pinar Keskinocak, Jeffrey P Kharoufeh, J Cole Smith
Publisher	John Wiley & Sons, Inc.
ISBN (Print)	978-0470400630
State	Published - 2013

Cite this

@inbook{6bc5c2bdffcd4ff698d1aa77d62681f0,

title = "Pure Cutting‐Plane Algorithms and their Convergence",

abstract = "Cutting‐plane methods solve a mixed‐integer program (MIP) by iteratively adding a valid linear inequality that violates a fractional solution of a linear relaxation of the problem. This article surveys cutting‐plane algorithms for different subclasses of MIPs and addresses whether these algorithms converge to an optimal solution of MIP in finitely many steps.",

author = "Dinakar Gade and Simge Kucukyavuz",

note = "https://doi.org/10.1002/9780470400531.eorms1084",

year = "2013",

language = "English (US)",

isbn = "978-0470400630",

editor = "Cochran, { James J} and {Cox Jr}, {Louis A} and Pinar Keskinocak and Kharoufeh, {Jeffrey P} and Smith, {J Cole}",

booktitle = "Wiley Encyclopedia of Operations Research and Management Science",

publisher = "John Wiley & Sons, Inc.",

}

Pure Cutting‐Plane Algorithms and their Convergence. / Gade, Dinakar; Kucukyavuz, Simge.

Wiley Encyclopedia of Operations Research and Management Science. ed. / James J Cochran; Louis A Cox Jr; Pinar Keskinocak; Jeffrey P Kharoufeh; J Cole Smith. John Wiley & Sons, Inc., 2013.

Research output: Chapter in Book/Report/Conference proceeding › Entry for encyclopedia/dictionary

TY - CHAP

T1 - Pure Cutting‐Plane Algorithms and their Convergence

AU - Gade, Dinakar

AU - Kucukyavuz, Simge

N1 - https://doi.org/10.1002/9780470400531.eorms1084

PY - 2013

Y1 - 2013

N2 - Cutting‐plane methods solve a mixed‐integer program (MIP) by iteratively adding a valid linear inequality that violates a fractional solution of a linear relaxation of the problem. This article surveys cutting‐plane algorithms for different subclasses of MIPs and addresses whether these algorithms converge to an optimal solution of MIP in finitely many steps.

AB - Cutting‐plane methods solve a mixed‐integer program (MIP) by iteratively adding a valid linear inequality that violates a fractional solution of a linear relaxation of the problem. This article surveys cutting‐plane algorithms for different subclasses of MIPs and addresses whether these algorithms converge to an optimal solution of MIP in finitely many steps.

M3 - Entry for encyclopedia/dictionary

SN - 978-0470400630

BT - Wiley Encyclopedia of Operations Research and Management Science

A2 - Cochran, James J

A2 - Cox Jr, Louis A

A2 - Keskinocak, Pinar

A2 - Kharoufeh, Jeffrey P

A2 - Smith, J Cole

PB - John Wiley & Sons, Inc.

ER -

Pure Cutting‐Plane Algorithms and their Convergence

Abstract

Fingerprint

Cite this