A modified active set algorithm for transportation discrete network design bi-level problem (Q506465)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A modified active set algorithm for transportation discrete network design bi-level problem |
scientific article; zbMATH DE number 6679483
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A modified active set algorithm for transportation discrete network design bi-level problem |
scientific article; zbMATH DE number 6679483 |
Statements
A modified active set algorithm for transportation discrete network design bi-level problem (English)
0 references
1 February 2017
0 references
discrete network design
0 references
bi-level problem
0 references
binary variable
0 references
modified active set algorithm
0 references
binary numeral system
0 references
ternary numeral system
0 references
0.7885627746582031
0 references
0.765895664691925
0 references
0.7524459958076477
0 references
0.7493231296539307
0 references
0.7335984110832214
0 references
