Continuous Reformulations for Zero–One Programming Problems

Continuous Reformulations for Zero–One Programming Problems

0.00 Avg rating0 Votes
Article ID: iaor20122820
Volume: 153
Issue: 1
Start Page Number: 75
End Page Number: 84
Publication Date: Apr 2012
Journal: Journal of Optimization Theory and Applications
Authors: ,
Keywords: programming (binary)
Abstract:

In this work, we study continuous reformulations of zero–one programming problems. We prove that, under suitable conditions, the optimal solutions of a zero–one programming problem can be obtained by solving a specific continuous problem.

Reviews

Required fields are marked *. Your email address will not be published.