Shortest-Route Methods: 2. Group Knapsacks, Expanded Networks, and Branch-and-Bound (Q4193265): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (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.1287/opre.27.3.548 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2151861549 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 20:41, 19 March 2024
scientific article; zbMATH DE number 3632225
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Shortest-Route Methods: 2. Group Knapsacks, Expanded Networks, and Branch-and-Bound |
scientific article; zbMATH DE number 3632225 |
Statements
Shortest-Route Methods: 2. Group Knapsacks, Expanded Networks, and Branch-and-Bound (English)
0 references
1979
0 references
Implicit Enumeration
0 references
Integer Programming
0 references
Group Theoretic Approach
0 references
Branch and Bound Algorithm
0 references
Network Programming
0 references
Group Knapsack Problem
0 references
Cyclic Network Algorithm
0 references
Expanded Network
0 references
