Substitutes and complements in network flows viewed as discrete convexity.
Kazuo MurotaAkiyoshi ShiouraPublished in: Discret. Optim. (2005)
Keyphrases
- network flow
- linear programming
- minimum cost
- integer programming
- min cost
- optimization model
- bipartite graph
- real time
- digital convexity
- discrete geometry
- convexity properties
- lower bound
- network flow problem
- np hard
- finite number
- continuous domains
- digital geometry
- discrete version
- network flow formulation
- discrete space
- special case
- computational complexity