Continuous reformulations for zero-one programming problems
From MaRDI portal
Publication:415420
DOI10.1007/S10957-011-9935-YzbMATH Open1237.90159OpenAlexW2054895961MaRDI QIDQ415420FDOQ415420
Authors: M. De Santis, F. Rinaldi 
Publication date: 8 May 2012
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-011-9935-y
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
- Convex Analysis
- A new class of functions for measuring solution integrality in the feasibility pump approach
- Introduction to global optimization.
- An algorithm for nonlinear optimization problems with binary variables
- Title not available (Why is that?)
- Exact penalty functions for nonlinear integer programming problems
- Title not available (Why is that?)
- Penalty formulation for zero-one nonlinear programming
- Penalty parameter for linearly constrained 0--1 quadratic programming
- Penalty for zero–one integer equivalent problem
- An exact penalty approach for solving a class of minimization problems with boolean variables
- Continuous approaches for solving discrete optimization problems
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
- Knapsack feasibility as an absolute value equation solvable by successive linear programming
- Constructing test functions for global optimization using continuous formulations of graph problems
- Finding independent sets in a graph using continuous multivariable polynomial formulations.
- New results on the equivalence between zero-one programming and continuous concave 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
Uses Software
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)
