A new global approach for 0-1 polynomial programs
From MaRDI portal
(Redirected from A new global approach for 0-1 polynomial programs)
A new global approach for \(0\)-\(1\) polynomial programs
A new global approach for \(0\)-\(1\) polynomial programs
Recommendations
- A linearization method for mixed 0--1 polynomial programs
- Equivalent Formulations of Nonlinear Integer Problems for Efficient Optimization
- An efficient linearization technique for mixed 0-1 polynomial problem
- On the polynomial mixed 0-1 fractional programming problems
- Linear forms of nonlinear expressions: new insights on old ideas
Cites work
- An approximate method for local optima for nonlinear mixed integer programming problems
- An implicit branch-and-bound algorithm for mixed-integer linear programming
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3495856 (Why is no real title available?)
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
- Note—An Improved Discrete Dynamic Programming Algorithm for Allocating Resources Among Interdependent Projects
- On implementation of computational algorithms for optimal design 2: Extensive numerical investigation
- Tabu Search Applied to the Quadratic Assignment Problem
- Tabu search for large scale timetabling problems
- Tabu Search—Part I
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
Cited in
(3)
This page was built for publication: A new global approach for \(0\)-\(1\) polynomial programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1317077)
