Pages that link to "Item:Q703274"
From MaRDI portal
The following pages link to A new linearization technique for multi-quadratic 0-1 programming problems. (Q703274):
Displayed 17 items.
- On zero duality gap in nonconvex quadratic programming problems (Q421278) (← links)
- Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems (Q439496) (← links)
- Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems (Q620513) (← links)
- An improved linearization technique for a class of quadratic 0-1 programming problems (Q691407) (← links)
- A review of recent advances in global optimization (Q842710) (← links)
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs (Q847822) (← links)
- Electroencephalogram (EEG) time series classification: applications in epilepsy (Q863612) (← links)
- On the time series support vector machine using dynamic time warping kernel for brain activity classification (Q946725) (← links)
- Linearization of a 0-1 quadratic fractional programming problem (Q998699) (← links)
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem (Q1025992) (← links)
- Linear and quadratic programming approaches for the general graph partitioning problem (Q1959249) (← links)
- Linear forms of nonlinear expressions: new insights on old ideas (Q2457269) (← links)
- An improved linearization strategy for zero-one quadratic programming problems (Q2458902) (← links)
- Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem (Q3406118) (← links)
- Time—Frequency Analysis of Brain Neurodynamics (Q3565462) (← links)
- LINEARIZATION OF 0-1 MULTI-QUADRATIC FRACTIONAL PROGRAMMING PROBLEM (Q3632032) (← links)
- On the Quadratic Programming Approach for Hub Location Problems (Q3638504) (← links)