Pages that link to "Item:Q4331894"
From MaRDI portal
The following pages link to A GREEDY ALGORITHM FOR MINIMIZING A SEPARABLE CONVEX FUNCTION OVER A FINITE JUMP SYSTEM (Q4331894):
Displaying 8 items.
- The \(S\)-digraph optimization problem and the greedy algorithm (Q1019296) (← links)
- The membership problem in jump systems (Q1369649) (← links)
- Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested (Q1926640) (← links)
- Polynomial-Time Algorithms for Linear and Convex Optimization on Jump Systems (Q3503231) (← links)
- A GREEDY ALGORITHM FOR MINIMIZING A SEPARABLE CONVEX FUNCTION OVER AN INTEGRAL BISUBMODULAR POLYHEDRON (Q4834042) (← links)
- M-Convex Functions on Jump Systems: A General Framework for Minsquare Graph Factor Problem (Q5470828) (← links)
- Neighbor systems, jump systems, and bisubmodular polyhedra (Q5891686) (← links)
- Geodesic property of greedy algorithms for optimization problems on jump systems and delta-matroids (Q6180564) (← links)
