Pages that link to "Item:Q3105769"
From MaRDI portal
The following pages link to M-Convex Function Minimization by Continuous Relaxation Approach: Proximity Theorem and Algorithm (Q3105769):
Displayed 11 items.
- Algorithms for separable convex optimization with linear ascending constraints (Q1628287) (← links)
- Simpler exchange axioms for M-concave functions on generalized polymatroids (Q1742881) (← links)
- Continuous relaxation for discrete DC programming (Q1749451) (← links)
- Decreasing minimization on M-convex sets: algorithms and applications (Q2089795) (← links)
- Decreasing minimization on base-polyhedra: relation between discrete and continuous cases (Q2111551) (← links)
- Scaling, proximity, and optimization of integrally convex functions (Q2414902) (← links)
- Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids (Q4581762) (← links)
- M-Convex Function Minimization Under L1-Distance Constraint and Its Application to Dock Reallocation in Bike-Sharing System (Q5085152) (← links)
- On a Reduction for a Class of Resource Allocation Problems (Q5087712) (← links)
- Continuous Relaxation for Discrete DC Programming (Q5356982) (← links)
- Generalizations of weighted matroid congestion games: pure Nash equilibrium, sensitivity analysis, and discrete convex function (Q5919290) (← links)