Pages that link to "Item:Q3205016"

The following pages link to Covering Relaxation for Positive 0-1 Polynomial Programs (Q3205016):

Displaying 7 items.

• Maximum weight archipelago subgraph problem (Q490157) (← links)
• An exact penalty function approach for nonlinear integer programming problems (Q580179) (← links)
• An ordering (enumerative) algorithm for nonlinear \(0-1\) programming (Q1338536) (← links)
• Nonlinear 0–1 programming: I. Linearization techniques (Q3216430) (← 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)