Solving linear conditional completely combinatorial optimization problems on permutations by the branch and bound method (Q465943): 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.1007/s10559-013-9508-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1989688593 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4745600 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Combinatorial optimization model of packing rectangles with stochastic parameters / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Transportation problems on permutations: properties of estimates in the branch and bound method / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4828110 / rank | |||
Normal rank | |||
Latest revision as of 05:45, 9 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving linear conditional completely combinatorial optimization problems on permutations by the branch and bound method |
scientific article |
Statements
Solving linear conditional completely combinatorial optimization problems on permutations by the branch and bound method (English)
0 references
24 October 2014
0 references
combinatorial optimization
0 references
permutations
0 references
branch and bound method
0 references
0 references
