Pages that link to "Item:Q1356513"
From MaRDI portal
The following pages link to A lower bound for a constrained quadratic \(0\)-\(1\) minimization problem (Q1356513):
Displaying 12 items.
- An improved closed-form solution for the constrained minimization of the root of a quadratic functional (Q442731) (← links)
- Functionally redundant constraints for Boolean quadratic-type optimization problems (Q852258) (← links)
- Upper-bounds for quadratic 0-1 maximization (Q913658) (← links)
- On the lower bound for a quadratic problem on the Stiefel manifold (Q1008338) (← links)
- On lower bounds for a class of quadratic 0,1 programs (Q1072937) (← links)
- A decomposition method for minimizing quadratic pseudo-Boolean functions (Q1118533) (← links)
- Persistency in quadratic 0-1 optimization (Q1190604) (← links)
- Minimization of a quadratic pseudo-Boolean function (Q1341991) (← links)
- A polyhedral approach for a constrained quadratic 0-1 problem (Q2387431) (← links)
- Upper bounds and exact algorithms for \(p\)-dispersion problems (Q2496032) (← links)
- Un Algorithme pour la Bipartition d'un Graphe en Sous-graphes de Cardinalité Fixée (Q4546064) (← links)
- Best reduction of the quadratic semi-assignment problem (Q5931788) (← links)
