D.C. programming approach for multicommodity network optimization problems with step increasing cost functions (Q598597)
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: D.C. programming approach for multicommodity network optimization problems with step increasing cost functions |
scientific article; zbMATH DE number 2088643
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | D.C. programming approach for multicommodity network optimization problems with step increasing cost functions |
scientific article; zbMATH DE number 2088643 |
Statements
D.C. programming approach for multicommodity network optimization problems with step increasing cost functions (English)
0 references
12 August 2004
0 references
Multicommodity network flows
0 references
Step increasing cost function
0 references
Capacity assignment problem
0 references
Flow assignment problem
0 references
Mixed-integer linear program
0 references
d.c. (difference of convex functions) program
0 references
Polyhedral d.c. program
0 references
Relaxation techniques
0 references
DCA (d.c. algorithm)
0 references
