Pages that link to "Item:Q691407"
From MaRDI portal
The following pages link to An improved linearization technique for a class of quadratic 0-1 programming problems (Q691407):
Displaying 14 items.
- An efficient linearization technique for mixed 0-1 polynomial problem (Q611852) (← links)
- Computationally attractive nonlinear models for combinatorial optimisation (Q843386) (← links)
- A network approach for specially structured linear programs arising in 0-1 quadratic optimization (Q943852) (← links)
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem (Q1025992) (← links)
- On the performance of linear programming heuristics applied on a quadratic transformation in the classification problem (Q1319558) (← links)
- On linearization techniques for budget-constrained binary quadratic programming problems (Q1709935) (← links)
- A neurodynamic approach to zero-one quadratic programming (Q2234482) (← links)
- Theoretical and computational study of several linearisation techniques for binary quadratic problems (Q2288865) (← links)
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs (Q2386196) (← links)
- An improved linearization strategy for zero-one quadratic programming problems (Q2458902) (← links)
- A roof linearization algorithm to obtain a tight upper bound for integer nonseparable quadratic programming (Q2883573) (← links)
- Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut (Q4025902) (← links)
- Mathematical Programming Models and Exact Algorithms (Q5050146) (← links)
- Exact mathematical formulations and metaheuristic algorithms for production cost minimization: a case study of the cable industry (Q5257894) (← links)
