Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

EOR
2010

favoriteEmaildiscussreport

140views more EOR 2010»

Cutting plane algorithms for 0-1 programming based on cardinality cuts

13 years 1 months ago

Cutting plane algorithms for 0-1 programming based on cardinality cuts

Download www.optimization-online.org

: We present new valid inequalities for 0-1 programming problems that work in similar ways to well known cover inequalities. Discussion and analysis of these cuts is followed by their revision and use in integer programming as a new generation of cuts that excludes not only portions of polyhedra containing noninteger points, also parts with some integer points that have been explored in search of an optimal solution. Our computational experimentations demonstrate that this new approach has significant potential for solving large scale integer programming problems.

Osman Oguz

Real-time Traffic

0-1 Programming Problems | EOR 2010 | Information Technology | Integer | Programming Problems |

claim paper

Related Content

» Computational Experience with an Interior Point Cutting Plane Algorithm

» Efficient Maximum Margin Clustering via Cutting Plane Algorithm

» On Quadratic Programming with a Ratio Objective

» Global Optimal Routing Scheduling and Power Control for MultiHop Wireless Networks with In...

» A Unifying Polyhedral Approximation Framework for Convex Optimization

» A New Exact Algorithm for the TwoSided Crossing Minimization Problem

» Partition inequalities for capacitated survivable network design based on directed pcycles

» Boosting Classifiers with Tightened L0Relaxation Penalties

» Fast Adaptive Algorithm for TimeCritical Color Quantization Application

Post Info
More Details (n/a)

Added	02 Mar 2011
Updated	02 Mar 2011
Type	Journal
Year	2010
Where	EOR
Authors	Osman Oguz

Comments (0)