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:8 - 1 self

Documents Related by Co-Citation

1054 Integer and Combinatorial Optimization – G L Nemhauser, L A Wolsey - 1988
1481 Theory of Linear and Integer Programming – A Schrijver - 1998
1156 Graph Theory – FRANK HARARY - 1969
641 LEDA: A Platform for Combinatorial and Geometric Computing – Kurt Mehlhorn, Stefan Näher, Christian Uhrig - 1999
1149 Geometric algorithms and combinatorial optimization – M Grötschel, L Lovász, A Schrijver - 1988
2359 Monotone Complexity – Michelangelo Grigni , Michael Sipser - 1990
1270 Graph Theory with Applications – J A Bondy, U S R Murty
952 Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming – M. X. Goemans, D.P. Williamson - 1995
578 Approximation Algorithms for NP-Hard Problems – D S Hochbaum - 1996