Feasibility recovery for the unit-capacity constrained permutation problem (Q1751174): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disopt.2015.09.004 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2187422511 / rank | |||
Normal rank | |||
Revision as of 19:30, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Feasibility recovery for the unit-capacity constrained permutation problem |
scientific article |
Statements
Feasibility recovery for the unit-capacity constrained permutation problem (English)
0 references
24 May 2018
0 references
discrete location and assignment
0 references
integer linear programming
0 references
vertex-disjoint path cover
0 references
shortest common supersequence
0 references
