Finding multiplies solutions for non-linear integer programming
From MaRDI portal
Recommendations
- Finding multiple solutions in nonlinear integer programming with algebraic test-sets
- Some algebraic methods for solving multiobjective polynomial integer programs
- scientific article; zbMATH DE number 177867
- On test sets for nonlinear integer maximization
- Finding all solutions of nonlinear equations using the dual simplex method
Cites work
- A branch and bound algorithm for designing reliable systems at a minimum cost
- A distributed computation algorithm for solving portfolio problems with integer variables
- An algebraic approach to integer portfolio problems
- An algebraic geometry algorithm for scheduling in presence of setups and correlated demands
- An exact algorithm for cost minimization in series reliability systems with multiple component choices
- Determining the K-best solutions of knapsack problems
- Exact cost minimization of a series-parallel reliable system with multiple component choices using an algebraic method
- Finding multiple solutions to general integer linear programs
- Using Algebraic Geometry
Cited in
(5)- An improved test set approach to nonlinear integer problems with applications to engineering design
- Some algebraic methods for solving multiobjective polynomial integer programs
- Finding multiple solutions in nonlinear integer programming with algebraic test-sets
- On test sets for nonlinear integer maximization
- Applying Gröbner basis method to multiparametric polynomial nonlinear programming
This page was built for publication: Finding multiplies solutions for non-linear integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1792079)
