Pages that link to "Item:Q494333"
From MaRDI portal
The following pages link to A framework of discrete DC programming by discrete convex analysis (Q494333):
Displayed 15 items.
- Continuous relaxation for discrete DC programming (Q1749451) (← links)
- Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming (Q1749453) (← links)
- The complexity of minimizing the difference of two \(M^{\natural}\)-convex set functions (Q1785434) (← links)
- Parametric monotone function maximization with matroid constraints (Q2010096) (← links)
- Maximize a monotone function with a generic submodularity ratio (Q2220848) (← links)
- Integrality of subgradients and biconjugates of integrally convex functions (Q2300646) (← links)
- Set function optimization (Q2314057) (← links)
- A new approach for solving mixed integer DC programs using a continuous relaxation with no integrality gap and smoothing techniques (Q5151528) (← links)
- Continuous Relaxation for Discrete DC Programming (Q5356982) (← links)
- Fast algorithms for maximizing monotone nonsubmodular functions (Q5918332) (← links)
- Fast algorithms for maximizing monotone nonsubmodular functions (Q5918746) (← links)
- Novel algorithms for maximum DS decomposition (Q5919061) (← links)
- Recent progress on integrally convex functions (Q6072365) (← links)
- MAP inference algorithms without approximation for collective graphical models on path graphs via discrete difference of convex algorithm (Q6097141) (← links)
- Strong substitutes: structural properties, and a new algorithm for competitive equilibrium prices (Q6120905) (← links)