Pages that link to "Item:Q1411397"
From MaRDI portal
The following pages link to Penalty parameter for linearly constrained 0--1 quadratic programming (Q1411397):
Displaying 14 items.
- Manifold relaxations for integer programming (Q380594) (← links)
- Continuous reformulations for zero-one programming problems (Q415420) (← links)
- Analysis of penalty parameters in binary constrained extremum problems (Q514709) (← links)
- New results on the equivalence between zero-one programming and continuous concave programming (Q839801) (← links)
- Exact penalty functions for nonlinear integer programming problems (Q983724) (← links)
- Penalty formulation for zero-one nonlinear programming (Q1091262) (← links)
- A new penalty parameter for linearly constrained 0--1 quadratic programming problems (Q1947625) (← links)
- Improved penalty algorithm for mixed integer PDE constrained optimization problems (Q2147266) (← links)
- A neurodynamic approach to zero-one quadratic programming (Q2234482) (← links)
- Continuous quadratic programming formulations of optimization problems on graphs (Q2629636) (← links)
- \texttt{EXPEDIS}: an exact penalty method over discrete sets (Q2673244) (← links)
- A continuous approch for globally solving linearly constrained quadratic (Q2767579) (← links)
- (Q4331898) (← links)
- A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems (Q5060789) (← links)
