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


Computational Experience with Generic Decomposition using the DIP Framework M.V. Galati∗ T.K. Ralphs†
Add to Reading List

Document Date: 2012-09-15 17:55:19


Open Document

File Size: 161,31 KB

Share Result on Facebook

City

Chesterbrook / Bethlehem / /

Company

COIN-OR LP / /

/

Facility

Abstract Library / SAS Institute / Project Name ALPS CBC CGL CLP CoinUtils OSI Description The Abstract Library / MILP Cut Generator Library / Lehigh University / /

IndustryTerm

generation-based algorithms / decomposition algorithms / search-handling layer / decomposition-based algorithms / tree search algorithms / separate pre-processing step / generic software framework / overall management / branch-and-bound algorithm / overall algorithm / software package / practical1 algorithms / generic decomposition-based algorithm / hybrid and advanced algorithms / feasible solutions / usable software / heuristic solutions / /

NaturalFeature

ALPS / /

Organization

SAS Institute / Department of Industrial and Systems / Lehigh University / Department of Industrial and Systems Engineering / /

/

Position

Traveling Salesman / /

ProgrammingLanguage

C++ / /

ProvinceOrState

Pennsylvania / /

Technology

three algorithms / decomposition-based algorithm / generic decomposition-based algorithm / overall algorithm / API / tree search algorithms / decomposition-based algorithms / decomposition algorithms / practical1 algorithms / branch-and-bound algorithm / column-generation-based algorithms / /

URL

http /

SocialTag