Back to Results
First PageMeta Content
Operations research / Linear programming relaxation / Dynamic programming / Shortest path problem / Linear programming / Dantzig–Wolfe decomposition / Algorithm / Minimum spanning tree / Delayed column-generation / Mathematics / Mathematical optimization / Applied mathematics


A Branch-and-Price Algorithm for Combined Location and Routing Problems Under Capacity Restrictions Z. Akca ∗ R.T. Berger †
Add to Reading List

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


Open Document

File Size: 110,88 KB

Share Result on Facebook

City

Concord / Bethlehem / /

/

Facility

Lehigh University / /

IndustryTerm

branchand-price algorithm / column generation algorithms / dynamic programming-based labeling algorithms / zero solution / label setting algorithm / branch-and-price algorithm / dual solution / integer solutions / symmetric solutions / heuristic algorithms / integer feasible solution / branch-and-cut algorithm / branch-and-price algorithms / given solution / tree algorithm / branch-and-bound algorithm / integer solution / transportation cost / solution algorithm / branch-and-cut algorithms / basic algorithm / /

Organization

Pj / Lehigh University / Department of Industrial and Systems Engineering / E¯ / /

/

ProgrammingLanguage

Perl / /

ProvinceOrState

Pennsylvania / Massachusetts / /

Technology

column generation algorithms / dynamic programming-based labeling algorithms / label setting algorithm / branchand-price algorithm / branch-and-price algorithms / 7 3 Solution Algorithm / two branch-and-cut algorithms / ESPPRC algorithm / solution algorithm / branch-and-cut algorithm / spanning tree algorithm / Perl / developed branch-and-cut algorithms / branch-and-bound algorithm / branch-and-price algorithm / pricing algorithm / /

URL

http /

SocialTag