A near-exact method for solving the log-truck scheduling problem (Q3158011): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1111/j.1475-3995.2004.00469.x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2050878124 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A method for solving ship routing problems with inventory constraints / 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: The General Pickup and Delivery Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An exact algorithm for IP column generation / rank | |||
Normal rank | |||
Latest revision as of 17:40, 7 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A near-exact method for solving the log-truck scheduling problem |
scientific article |
Statements
A near-exact method for solving the log-truck scheduling problem (English)
0 references
20 January 2005
0 references
