Pages that link to "Item:Q839801"
From MaRDI portal
The following pages link to New results on the equivalence between zero-one programming and continuous concave programming (Q839801):
Displaying 12 items.
- Continuous reformulations for zero-one programming problems (Q415420) (← links)
- Convergence of a continuous approach for zero-one programming problems (Q621018) (← links)
- Exact penalty functions for nonlinear integer programming problems (Q983724) (← links)
- On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems (Q1732230) (← links)
- An exact penalty global optimization approach for mixed-integer programming problems (Q1940438) (← links)
- A new penalty parameter for linearly constrained 0--1 quadratic programming problems (Q1947625) (← links)
- An improved penalty algorithm using model order reduction for MIPDECO problems with partial observations (Q2111473) (← links)
- Improved penalty algorithm for mixed integer PDE constrained optimization problems (Q2147266) (← links)
- Feasibility Pump-like heuristics for mixed integer problems (Q2448898) (← links)
- Continuous quadratic programming formulations of optimization problems on graphs (Q2629636) (← links)
- A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems (Q5060789) (← links)
- On choosing initial values of iteratively reweighted \(\ell_1\) algorithms for the piece-wise exponential penalty (Q6587598) (← links)
