Pages that link to "Item:Q3216431"
From MaRDI portal
The following pages link to Nonlinear 0–1 programming: II. Dominance relations and algorithms (Q3216431):
Displaying 17 items.
- Pseudo-Boolean optimization (Q697569) (← links)
- Upper-bounds for quadratic 0-1 maximization (Q913658) (← links)
- Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method (Q946351) (← links)
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem (Q1025992) (← links)
- Lagrangean decomposition for integer nonlinear programming with linear constraints (Q1181738) (← links)
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique (Q1187374) (← links)
- A survey of algorithms for the generalized assignment problem (Q1199507) (← links)
- A constrained nonlinear 0-1 program for data allocation (Q1290718) (← links)
- An ordering (enumerative) algorithm for nonlinear \(0-1\) programming (Q1338536) (← links)
- Strong valid inequalities for Boolean logical pattern generation (Q1675646) (← links)
- Robust metaheuristic algorithm for redundancy optimization in large-scale complex systems (Q1772975) (← links)
- A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope (Q1892658) (← links)
- A multi-term, polyhedral relaxation of a 0-1 multilinear function for Boolean logical pattern generation (Q2274853) (← links)
- The basic algorithm for pseudo-Boolean programming revisited (Q2277139) (← links)
- On the number of local maxima in quadratic 0-1 programs (Q2367394) (← links)
- An algorithm for indefinite integer quadratic programming (Q2641219) (← links)
- Nonlinear 0–1 programming: I. Linearization techniques (Q3216430) (← links)
