A solution approach for log truck scheduling based on composite pricing and branch and bound (Q3044067): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1111/1475-3995.00420 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2019943475 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The pickup and delivery problem with time windows / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5630824 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The General Pickup and Delivery Problem / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 18:48, 6 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A solution approach for log truck scheduling based on composite pricing and branch and bound |
scientific article |
Statements
A solution approach for log truck scheduling based on composite pricing and branch and bound (English)
0 references
10 August 2004
0 references
vehicle routing
0 references
forestry
0 references
pick up and delivery
0 references
composite princing
0 references
branch-and-bound
0 references
