Back to Results
First PageMeta Content
Operations research / Combinatorial optimization / Convex optimization / Linear programming / Bilevel program / Branch and cut / Cutting-plane method / Branch and bound / Duality / Mathematical optimization / Mathematics / Applied mathematics


A Branch-and-cut Algorithm for Integer Bilevel Linear Programs S.T. DeNegre∗ T.K Ralphs †
Add to Reading List

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


Open Document

File Size: 189,92 KB

Share Result on Facebook

City

Bethlehem / /

Company

COIN-OR LP / Intel / /

/

Event

Reorganization / /

Facility

Multiple Criteria Decision Making library / Lehigh University / Cut Generation Library / /

IndustryTerm

upper-level solution / bilevel infeasible solutions / solution technology / law enforcement applications / generalized branch-and-cut algorithm / branch-andbound algorithm / search trees / branch-and-bound algorithms / basic feasible solution / feasible solution / integer solutions / software repository / node processing subroutine / rudimentary branch-and-cut algorithm / branch-and-cut algorithm / fixed upper-level solution / software components / fractional solution / branch-and-bound algorithm / straightforward way using existing software / integer solution / fractional solutions / less efficient search / infeasible integer solution / feasible solutions / heuristic solutions / using software components / /

Organization

Lehigh University / Department of Industrial and Systems Engineering / /

Person

Yang / Wen / /

/

ProgrammingLanguage

C++ / /

ProvinceOrState

Pennsylvania / /

Technology

generalized branch-and-cut algorithm / Xeon 2.4GHz processor / rudimentary branch-and-cut algorithm / solution technology / IBLP algorithm / LP-based branch-and-bound algorithms / branch-and-cut algorithm / branch-and-bound algorithm / branch-andbound algorithm / /

URL

http /

SocialTag