Solving the Maximum Weight Planar Subgraph Problem by Branch and Cut (1993)

by Michael Jünger , Petra Mutzel
Venue:PROCEEDINGS OF THE THIRD CONFERENCE ON INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION
Citations:11 - 1 self

Documents Related by Co-Citation

1546 Theory of Linear and Integer Programming – A Schrijver - 1986
1140 Integer and Combinatorial Optimization – G L Nemhauser, L A Wolsey - 1988
1259 Graph Theory – F Harary - 1969
674 LEDA: A Platform for Combinatorial and Geometric Computing – Kurt Mehlhorn, Stefan Näher, Christian Uhrig - 1999
1194 Geometric Algorithms and Combinatorial Optimization – M Grotschel, L Lov'asz, A Schrijver - 1988
2429 Monotone Complexity – Michelangelo Grigni , Michael Sipser - 1990
1370 Graph Theory with Applications – J A Bondy, U S R Murty - 1976
974 Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming – M. X. Goemans, D.P. Williamson - 1995
604 Approximation Algorithms for NP-Hard Problems – D Hochbaum, editor - 1997