A profit-maximization location-routing-pricing problem: a branch-and-price algorithm (Q1653368)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A profit-maximization location-routing-pricing problem: a branch-and-price algorithm |
scientific article; zbMATH DE number 6913721
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A profit-maximization location-routing-pricing problem: a branch-and-price algorithm |
scientific article; zbMATH DE number 6913721 |
Statements
A profit-maximization location-routing-pricing problem: a branch-and-price algorithm (English)
0 references
3 August 2018
0 references
location-routing problems (LRP)
0 references
vehicle routing problems with profit (VRPP)
0 references
price-sensitive demands and delivered pricing
0 references
mixed-integer linear programming (MILP)
0 references
branch-and-price and column generation
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9088655
0 references
0.90031236
0 references
0.8944332
0 references
0.8937813
0 references
0.88900995
0 references
0.8881216
0 references
0.8866626
0 references
