Back to Results
First PageMeta Content



On the Complexity of Selecting Disjunctions in Integer Programming Ashutosh Mahajan∗ Ted Ralphs
Add to Reading List

Document Date: 2016-03-26 12:56:25

Open Document

File Size: 271,72 KB

Share Result on Facebook

City

Bethlehem / /

/

Facility

Lehigh University / /

IndustryTerm

cuttingplane algorithms / polynomial time algorithms / feasible solution / search tree / computing / branch-and-bound algorithm / search space / feasible solutions / /

Organization

Lehigh University / Department of Industrial and Systems Engineering / Zn / /

/

Position

Selecting General / /

ProgrammingLanguage

L / R / /

ProvinceOrState

Pennsylvania / /

Technology

cutting-plane algorithms / cuttingplane algorithms / ISP / LP-based branch-and-bound algorithm / polynomial time algorithms / 2 Cutting-Plane Algorithms / branch-and-bound algorithm / Branch-and-Bound Algorithms / cutting-plane algorithm / two algorithms / /

URL

http /

SocialTag