Back to Results
First PageMeta Content
Applied mathematics / Combinatorial optimization / Linear programming / Linear programming relaxation / COIN-OR / Branch and cut / Algorithm / Divide and conquer algorithm / Optimization problem / Mathematical optimization / Mathematics / Operations research


Branch, Cut, and Price: Sequential and Parallel ? T.K. Ralphs1 , L. Lad´anyi2 , and L.E. Trotter, Jr.3 1
Add to Reading List

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

Open Document

File Size: 297,17 KB

Share Result on Facebook

City

Ithaca / /

Company

IBM / /

/

Event

Reorganization / /

Facility

Cornell University / Lehigh University / /

IndustryTerm

price algorithms / search node / cut pool management / theoretical tools / parallel computing / large search trees / feasible solution / integer solutions / airline crew scheduling / important applications / telecommunications / intelligent search algorithms / cut algorithm / relaxed solution / search tree / bound algorithms / software libraries / tree management / separation algorithms / software packages / related software / computational tools / pool management / software development / bound algorithm / feasible solutions / generalpurpose algorithms / term search tree / /

Organization

National Science Foundation / Department of Industrial and Manufacturing Systems Engineering / School of OR&IE / S. Suppose / Lehigh University / Cornell University / /

Person

L.E. Trotter / Jr. / /

/

Position

Traveling Salesman / /

ProgrammingLanguage

L / C++ / /

ProvinceOrState

New York / /

Technology

price algorithms / Application Program Interface / cut algorithm / API / separation algorithms / intelligent search algorithms / implementing BCP algorithms / generalpurpose algorithms / BCP algorithm / BCP algorithms / /

URL

http /

SocialTag