Exact algorithms for a selective Vehicle Routing Problem where the longest route is minimized (Q2840529): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Local branching / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A new variant of a vehicle routing problem: Lower and upper bounds / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficient separation routines for the symmetric traveling salesman problem. I: General tools and comb separation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems / rank | |||
Normal rank | |||
Latest revision as of 16:18, 6 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exact algorithms for a selective Vehicle Routing Problem where the longest route is minimized |
scientific article |
Statements
Exact algorithms for a selective Vehicle Routing Problem where the longest route is minimized (English)
0 references
19 July 2013
0 references
combinatorial optimization
0 references
branch-and-cut
0 references
local branching
0 references
0 references
