Back to Results
First PageMeta Content
Combinatorial optimization / Operations research / Mathematical logic / Linear programming / Linear programming relaxation / Cutting-plane method / Algorithm / Branch and bound / Branch and cut / Mathematical optimization / Mathematics / Theoretical computer science


Experiments with Branching using General Disjunctions A. Mahajan∗ T.K Ralphs †
Add to Reading List

Document Date: 2010-06-19 14:25:53

Open Document

File Size: 196,79 KB

Share Result on Facebook

City

Bethlehem / /

Company

P LP / /

/

Facility

Lehigh University / /

IndustryTerm

by-product / branch-and-cut algorithm / polynomial time algorithms / fractional optimal solution / feasible solution / search space / substantial additional search time / binary search / feasible solutions / heuristic solutions / /

Organization

Lehigh University / Department of Industrial and Systems Engineering / /

/

Position

Branching using General / representative / /

ProvinceOrState

Pennsylvania / /

Technology

branch-and-cut algorithm / polynomial time algorithms / /

URL

http /

SocialTag