Pages that link to "Item:Q3710308"
From MaRDI portal
The following pages link to An efficient algorithm for minimizing a multivariate polyhedral function along a line (Q3710308):
Displaying 8 items.
- Minmax linear programmes with grouped variables (Q1122476) (← links)
- A linear-time algorithm to compute the conjugate of convex piecewise linear-quadratic bivariate functions (Q1639725) (← links)
- A successive relaxation algorithm to solve a MILP involving piecewise linear functions with application to road design (Q2114828) (← links)
- A nonconvex, piecewise linear optimization problem (Q2640447) (← links)
- On superlinear convergence in univariate nonsmooth minimization (Q2640452) (← links)
- On the minimization of a class of generalized linear functions on a flow polytope (Q2926471) (← links)
- A mofified gub algorithm for solving linear minimax problems (Q4729610) (← links)
- Scalable Minimizing-Operators on Polyhedra via Parametric Linear Programming (Q5233243) (← links)