IPCO 2008 - PDF Preprint Papers

IPCO 2008 International Conference on Integer Programming and Combinatorial Optimization

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed IPCO-2008 Paper

click to vote

IPCO
2008

221views Optimization» more IPCO 2008»

A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem

14 years 26 days ago

Download www-user.tu-chemnitz.de

Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...

Michael Armbruster, Marzena Fügenschuh, Chris...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	221	A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem	claim
2	188	Binary Positive Semidefinite Matrices and Associated Integer Polytopes	claim
3	163	The Air Traffic Flow Management Problem: An Integer Optimization Approach	claim
4	143	Primal-Dual Schema for Capacitated Covering Problems	claim
5	136	Computing with Multi-row Gomory Cuts	claim
6	131	Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints	claim
7	129	A Polynomial Time Approximation Scheme for the Square Packing Problem	claim
8	118	Constraint Orbital Branching	claim
9	114	The Stochastic Machine Replenishment Problem	claim
10	110	Importance Sampling via Load-Balanced Facility Location	claim
11	110	The Stable Roommates Problem with Choice Functions	claim
12	105	Can Pure Cutting Plane Algorithms Work?	claim
13	103	Degree Bounded Matroids and Submodular Flows	claim
14	103	Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles	claim
15	91	New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem	claim
16	90	The Induced Disjoint Paths Problem	claim
17	87	Vertex Cover Resists SDPs Tightened by Local Hypermetric Inequalities	claim
18	82	A New Approach to Splitting-Off	claim
19	78	Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers