State-space relaxation procedures for the computation of bounds to routing problems (Q3908783): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 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.1002/net.3230110207 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2163873159 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3908789 / rank | |||
Normal rank | |||
Latest revision as of 12:08, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | State-space relaxation procedures for the computation of bounds to routing problems |
scientific article |
Statements
State-space relaxation procedures for the computation of bounds to routing problems (English)
0 references
1981
0 references
state-space relaxation procedures
0 references
computation of bounds
0 references
routing problems
0 references
combinatorial optimization
0 references
traveling salesman problem
0 references
vehicle routing
0 references
subgradient optimization
0 references
state space ascent
0 references
