Continuous reformulations for zero-one programming problems
From MaRDI portal
Recommendations
- Convergence of a continuous approach for zero-one programming problems
- New results on the equivalence between zero-one programming and continuous concave programming
- Global Optimization for Mixed 0-1 Programs with Convex or Separable Continuous Functions
- scientific article; zbMATH DE number 1381038
- Exact penalty functions for nonlinear integer programming problems
Cites work
- scientific article; zbMATH DE number 3534294 (Why is no real title available?)
- scientific article; zbMATH DE number 1302171 (Why is no real title available?)
- A new class of functions for measuring solution integrality in the feasibility pump approach
- An algorithm for nonlinear optimization problems with binary variables
- An exact penalty approach for solving a class of minimization problems with boolean variables
- Constructing test functions for global optimization using continuous formulations of graph problems
- Continuous approaches for solving discrete optimization problems
- Convex Analysis
- Exact penalty functions for nonlinear integer programming problems
- Finding independent sets in a graph using continuous multivariable polynomial formulations.
- Introduction to global optimization.
- Knapsack feasibility as an absolute value equation solvable by successive linear programming
- New results on the equivalence between zero-one programming and continuous concave programming
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
- Penalty for zero–one integer equivalent problem
- Penalty formulation for zero-one nonlinear programming
- Penalty parameter for linearly constrained 0--1 quadratic programming
Cited in
(3)- On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems
- New results on the equivalence between zero-one programming and continuous concave programming
- Convergence of a continuous approach for zero-one programming problems
This page was built for publication: Continuous reformulations for zero-one programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q415420)
