Pages that link to "Item:Q3932587"
From MaRDI portal
The following pages link to An accelerated covering relaxation algorithm for solving 0–1 positive polynomial programs (Q3932587):
Displaying 7 items.
- An exact penalty function approach for nonlinear integer programming problems (Q580179) (← links)
- A dynamic programming algorithm for multiple-choice constraints (Q798257) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- Univariate parameterization for global optimization of mixed-integer polynomial problems (Q2355892) (← links)
- Nonlinear 0–1 programming: II. Dominance relations and algorithms (Q3216431) (← links)
- An accelerated covering relaxation algorithm for solving 0–1 positive polynomial programs (Q3932587) (← links)
- A revised Taha's algorithm for polynomial 0-1 programming (Q5426969) (← links)
