Back to Results
First PageMeta Content
Relaxation / Linear programming / Cutting-plane method / Dantzig–Wolfe decomposition / Lagrangian relaxation / Decomposition method / Mathematical optimization / Convex optimization / Operations research


Decomposition and Dynamic Cut Generation in Integer Linear Programming T.K. Ralphs∗ M.V. Galati†
Add to Reading List

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

Open Document

File Size: 414,47 KB

Share Result on Facebook

City

Cary / Bethlehem / /

Company

Dantzig-Wolfe LP. / /

Currency

pence / /

/

Event

Reorganization / /

Facility

Lehigh University / SAS Institute / /

IndustryTerm

by-product / software framework / fractional solution / dual solution / plane algorithm / separation algorithms / bound algorithm / primal solution / /

Organization

SAS Institute / Dantzig-Wolfe LP / Lehigh University / S. Hence / Department of Industrial and Systems Engineering / /

/

Position

general treatment / /

ProvinceOrState

North Carolina / Pennsylvania / /

Technology

solution algorithms / cutting plane algorithm / separation algorithms / 2005 Abstract Decomposition algorithms / /

URL

http /

SocialTag