Pages that link to "Item:Q3893670"

The following pages link to Technical Note—Generalized Covering Relaxation for 0-1 Programs (Q3893670):

Displaying 8 items.

• Concave extensions for nonlinear 0-1 maximization problems (Q689146) (← links)
• A dynamic production planning and scheduling algorithm for two products processed on one line (Q799234) (← links)
• A search algorithm for the minimum cost covering of 0-1 integers sets (Q1165558) (← links)
• The basic algorithm for pseudo-Boolean programming revisited (Q2277139) (← links)
• An algorithm for indefinite integer quadratic programming (Q2641219) (← links)
• Nonlinear 0–1 programming: I. Linearization techniques (Q3216430) (← links)
• Nonlinear 0–1 programming: II. Dominance relations and algorithms (Q3216431) (← links)
• A revised Taha's algorithm for polynomial 0-1 programming (Q5426969) (← links)