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


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

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

Open Document

File Size: 207,06 KB

Share Result on Facebook

City

Bruxelles / /

Company

-Wolfe LP / Dantzig-Wolfe LP / /

Currency

pence / GBP / /

Event

Reorganization / /

Facility

Lehigh University / /

IndustryTerm

generic software framework / effective3 algorithms / fractional solution / fractional solutions / integer solutions / bound algorithm / preliminary literature search / /

Organization

Lehigh University / /

Person

Kohl / /

Position

Fisher / Salesman / Traveling Salesman / /

Technology

SST-Based Algorithm / 2003 Abstract Decomposition algorithms / effective3 algorithms / /

SocialTag