Pages that link to "Item:Q3993663"
From MaRDI portal
The following pages link to Solving Piecewise-Linear Programs: Experiments with a Simplex Approach (Q3993663):
Displaying 14 items.
- Finding all solutions of separable systems of piecewise-linear equations using integer programming (Q413729) (← links)
- A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy (Q1110457) (← links)
- A simplex algorithm for piecewise-linear programming. III: Computational analysis and applications (Q1184346) (← links)
- Algorithms for network piecewise-linear programs: A comparative study (Q1278601) (← links)
- Some questions of piecewise linear programming (Q1282483) (← links)
- A restricted-entry method for a transportation problem with piecewise- linear concave costs (Q1332825) (← links)
- A generator and a simplex solver for network piecewise linear programs (Q1335389) (← links)
- Optimal objective function approximation for separable convex quadratic programming (Q1340073) (← links)
- The hill detouring method for minimizing hinging hyperplanes functions (Q1762167) (← links)
- Finding normal solutions in piecewise linear programming (Q1900115) (← links)
- Piecewise linear valued constraint satisfaction problems with fixed number of variables (Q2056915) (← links)
- A parametric simplex algorithm for biobjective piecewise linear programming problems (Q2628166) (← links)
- A Family of Simplex Variants Solving an <i>m</i> × <i>d</i> Linear Program in Expected Number of Pivot Steps Depending on <i>d</i> Only (Q3755232) (← links)
- (Q4382755) (← links)