An MPEC formulation and its cutting constraint algorithm for continuous network design problem with multi-user classes (Q1994496)
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: An MPEC formulation and its cutting constraint algorithm for continuous network design problem with multi-user classes |
scientific article; zbMATH DE number 6970399
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An MPEC formulation and its cutting constraint algorithm for continuous network design problem with multi-user classes |
scientific article; zbMATH DE number 6970399 |
Statements
An MPEC formulation and its cutting constraint algorithm for continuous network design problem with multi-user classes (English)
0 references
1 November 2018
0 references
continuous network design problem (CNDP)
0 references
mathematical programming with equilibrium constraint (MPEC)
0 references
cutting constraint algorithm (CCA)
0 references
multi-user classes
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.88808197
0 references
0.8725229
0 references
0.8439624
0 references
0.84265226
0 references
0.8392292
0 references
0.83755445
0 references
0.83546686
0 references
0.83523154
0 references
0.83335835
0 references
