Pages that link to "Item:Q2248748"
From MaRDI portal
The following pages link to Dijkstra's algorithm and L-concave function maximization (Q2248748):
Displaying 4 items.
- A framework of discrete DC programming by discrete convex analysis (Q494333) (← links)
- Research on routing algorithm based on limitation arrangement principle in mathematics (Q1718627) (← links)
- Exact bounds for steepest descent algorithms of $L$-convex function minimization (Q1785253) (← links)
- Note on the polyhedral description of the Minkowski sum of two L-convex sets (Q2111552) (← links)
