Continuous reformulations for zero-one programming problems

DOI10.1007/s10957-011-9935-yzbMath1237.90159OpenAlexW2054895961MaRDI QIDQ415420

Marianna De Santis, Francesco 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

zbMATH Keywords

concave functionscontinuous programmingzero-one programming

Mathematics Subject Classification ID

Boolean programming (90C09)

Related Items (1)

On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems

Uses Software

• FEASPUMP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithm for nonlinear optimization problems with binary variables
• New results on the equivalence between zero-one programming and continuous concave programming
• Exact penalty functions for nonlinear integer programming problems
• Knapsack feasibility as an absolute value equation solvable by successive linear programming
• Penalty formulation for zero-one nonlinear programming
• Penalty parameter for linearly constrained 0--1 quadratic programming
• A New Class of Functions for Measuring Solution Integrality in the Feasibility Pump Approach
• Penalty for zero–one integer equivalent problem
• An exact penalty approach for solving a class of minimization problems with boolean variables
• On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
• Convex Analysis
• Constructing test functions for global optimization using continuous formulations of graph problems
• Introduction to global optimization.
• Finding independent sets in a graph using continuous multivariable polynomial formulations.

This page was built for publication: Continuous reformulations for zero-one programming problems