Back to Results
First PageMeta Content
Theoretical computer science / Combinatorial optimization / Knapsack problem / Cutting-plane method / Linear programming relaxation / Linear programming / Simplex algorithm / Dynamic programming / Mathematical optimization / Operations research / Applied mathematics


On the Exact Separation of Mixed Integer Knapsack Cuts Ricardo Fukasawa1 and Marcos Goycoolea2 1 H. Milton Stewart School of Industrial and Systems Engineering
Add to Reading List

Document Date: 2008-04-11 12:49:59

Open Document

File Size: 170,83 KB

Share Result on Facebook

Company

Intel / /

/

Facility

Systems Engineering Georgia Institute / Arithmetic library / /

IndustryTerm

simplex algorithm / non-dominated optimal solution / linear programming algorithm / smallest optimum solution / plane algorithms / dynamic cut generation algorithm / computing / separation algorithm / depth-first-search branch / bound algorithms / basic solution / enumeration algorithm / cut generation algorithm / optimum solution / bound search / search space / bound algorithm / feasible solutions / /

OperatingSystem

Linux / GNU / /

Organization

Business Universidad / Georgia Institute of Technology / H. Milton Stewart School of Industrial / /

Person

Boyd / Yan / Adolfo Iba˜ nez / /

Position

rt / /

Product

Applegate et al. / /

ProgrammingLanguage

C / K / C++ / /

Technology

cutting plane algorithms / enumeration algorithm / kbb algorithm / Linux / linear programming algorithm / simplex algorithm / MIKP algorithm / separation algorithm / dynamic cut generation algorithm / Histogram comparing KBB algorithm / cut generation algorithm / following four-step preprocessing algorithm / /

SocialTag