Pages that link to "Item:Q3328282"
From MaRDI portal
The following pages link to Penalty for zero–one integer equivalent problem (Q3328282):
Displayed 18 items.
- A gradient-based approach for discrete optimum design (Q381494) (← links)
- Continuous reformulations for zero-one programming problems (Q415420) (← links)
- Analysis of penalty parameters in binary constrained extremum problems (Q514709) (← links)
- Integrated network capacity expansion and traffic signal optimization problem: Robust bi-level dynamic formulation (Q613549) (← links)
- Convergence of a continuous approach for zero-one programming problems (Q621018) (← links)
- A smoothing method for zero--one constrained extremum problems (Q637567) (← 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)
- Penalty formulation for zero-one nonlinear programming (Q1091262) (← links)
- An interior point algorithm to solve computationally difficult set covering problems (Q1181917) (← links)
- Lagrangean duality for facial programs with applications to integer and complementarity problems (Q1196216) (← links)
- Penalty parameter for linearly constrained 0--1 quadratic programming (Q1411397) (← links)
- On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems (Q1732230) (← links)
- Discrete linear bilevel programming problem (Q1918022) (← links)
- An exact penalty global optimization approach for mixed-integer programming problems (Q1940438) (← links)
- Lagrangian duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint (Q2564166) (← links)
- An exact penalty approach for solving a class of minimization problems with boolean variables (Q3815860) (← links)