  


Extended Linear Formulation for Binary Quadratic Problems
Fabio Furini (fabio.furini82gmail.com) Abstract: In this work we propose and test a new linearisation technique for Binary Quadratic Problems (BQP). We computationally prove that the new formulation, called Extended Linear Formulation, performs much better than the standard one in practice, despite not being stronger in terms of Linear Programming relaxation (LP). We empirically prove that this behaviour is due to the fact of having a less degenerate LP. Our tests are based on two sets of classical BQP from the literature, i.e., the unconstrained binary quadratic problem and the maximum cut of edgeweighted graphs. Finally we introduce an indicator that can be used to compare two different formulations in order to identify the less degenerate one. Keywords: Binary Quadratic Problem; Linearization Technique; Extended Formulations; Degeneracy; Maximum Cut Problem Category 1: Integer Programming (01 Programming ) Category 2: Nonlinear Optimization (Quadratic Programming ) Citation: Download: [PDF] Entry Submitted: 06/30/2013 Modify/Update this entry  
Visitors  Authors  More about us  Links  
Subscribe, Unsubscribe Digest Archive Search, Browse the Repository

Submit Update Policies 
Coordinator's Board Classification Scheme Credits Give us feedback 
Optimization Journals, Sites, Societies  