Pages that link to "Item:Q3815860"
From MaRDI portal
The following pages link to An exact penalty approach for solving a class of minimization problems with boolean variables (Q3815860):
Displaying 15 items.
- Manifold relaxations for integer programming (Q380594) (← links)
- A gradient-based approach for discrete optimum design (Q381494) (← links)
- Continuous reformulations for zero-one programming problems (Q415420) (← links)
- An efficient Lagrangian smoothing heuristic for max-cut (Q549567) (← links)
- Convergence of a continuous approach for zero-one programming problems (Q621018) (← links)
- A smoothing method for zero--one constrained extremum problems (Q637567) (← links)
- An algorithm for nonlinear optimization problems with binary variables (Q711384) (← links)
- On duality for Boolean programming (Q750292) (← 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)
- A global continuation algorithm for solving binary quadratic programming problems (Q1029635) (← links)
- Unconstrained 0-1 nonlinear programming: A nondifferentiable approach (Q1187840) (← 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)
- Continuous quadratic programming formulations of optimization problems on graphs (Q2629636) (← links)
