How good is the Goemans-Williamson MAX CUT algorithm?
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Consolidating Maintenance Spares
Computational Optimization and Applications
Improved approximation of max-cut on graphs of bounded degree
Journal of Algorithms
A Polyhedral Approach for Nonconvex Quadratic Programming Problemswith Box Constraints
Journal of Global Optimization
Lagrangian bounds in multiextremal polynomial and discrete optimization problems
Journal of Global Optimization
Random Structures & Algorithms - Probabilistic methods in combinatorial optimization
On the optimality of the random hyperplane rounding technique for max cut
Random Structures & Algorithms - Probabilistic methods in combinatorial optimization
Approximability of the Minimum Bisection Problem: An Algorithmic Challenge
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS
Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
Discrete Applied Mathematics
The bundle method for hard combinatorial optimization problems
Combinatorial optimization - Eureka, you shrink!
A Semidefinite Programming Based Polyhedral Cut and Price Approach for the Maxcut Problem
Computational Optimization and Applications
Efficiently solving convex relaxations for MAP estimation
Proceedings of the 25th international conference on Machine learning
Exact Algorithms for the Quadratic Linear Ordering Problem
INFORMS Journal on Computing
A new exact algorithm for the two-sided crossing minimization problem
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Binary positive semidefinite matrices and associated integer polytopes
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
A basic toolbox for constrained quadratic 0/1 optimization
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
An exact approach to the problem of extracting an embedded network matrix
Computers and Operations Research
Sherali-Adams relaxations and indistinguishability in counting logics
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Hybrid genetic algorithm within branch-and-cut for the minimum graph bisection problem
EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
Small bipartite subgraph polytopes
Operations Research Letters
Survey: Cycle bases in graphs characterization, algorithms, complexity, and applications
Computer Science Review
Cardinality constrained combinatorial optimization: Complexity and polyhedra
Discrete Optimization
Facet-defining inequalities for the simple graph partitioning polytope
Discrete Optimization
Exploiting planarity in separation routines for the symmetric traveling salesman problem
Discrete Optimization
Operations Research Letters
The expected relative error of the polyhedral approximation of the max-cut problem
Operations Research Letters
Using separation algorithms to generate mixed integer model reformulations
Operations Research Letters
Cliques and clustering: A combinatorial approach
Operations Research Letters
A note on the Boolean quadric polytope
Operations Research Letters
Minimizing breaks by maximizing cuts
Operations Research Letters
A fast algorithm for minimum weight odd circuits and cuts in planar graphs
Operations Research Letters
Lifting facets of the cut polytope
Operations Research Letters
Gap inequalities for the max-cut problem: a cutting-plane algorithm
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
A computational study and survey of methods for the single-row facility layout problem
Computational Optimization and Applications
European Journal of Combinatorics
| Hi-index | 0.00 |