A penalty decomposition with cardinality constraints and block coordinate descent solves combinatorial bilevel congestion pricing at 3,000-link scale with convergence to an approximate KKT point.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A Cardinality-Constrained Approach to Combinatorial Bilevel Congestion Pricing
A penalty decomposition with cardinality constraints and block coordinate descent solves combinatorial bilevel congestion pricing at 3,000-link scale with convergence to an approximate KKT point.