Finding multiplies solutions for non-linear integer programming

DOI10.1016/j.endm.2018.06.022zbMath1408.90189OpenAlexW2885021508MaRDI QIDQ1792079

José Manuel Jiménez Cobano, José María Ucha Enríquez

Publication date: 11 October 2018

Full work available at URL: https://idus.us.es/handle//11441/93576

zbMATH Keywords

Groebner basisinteger nonlinear optimizationtest-setsmultiplies solutions

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items

Applying Gröbner basis method to multiparametric polynomial nonlinear programming

Uses Software

• Couenne
• 4ti2

Cites Work

• Exact cost minimization of a series-parallel reliable system with multiple component choices using an algebraic method
• Determining the \(K\)-best solutions of knapsack problems
• An algebraic approach to integer portfolio problems
• An exact algorithm for cost minimization in series reliability systems with multiple component choices
• An algebraic geometry algorithm for scheduling in presence of setups and correlated demands
• Finding multiple solutions to general integer linear programs
• A distributed computation algorithm for solving portfolio problems with integer variables
• Using Algebraic Geometry
• A branch and bound algorithm for designing reliable systems at a minimum cost