Formulations and valid inequalities for the node capacitated graph partitioning problem

Consolidating Maintenance Spares

Computational Optimization and Applications

Facets of the Directed Acyclic Graph Layering Polytope

WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science

Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation

An approximate dynamic programming approach to convex quadratic knapsack problems

Computers and Operations Research

The quadratic knapsack problem-a survey

Discrete Applied Mathematics

Orbitopal Fixing

IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization

An approximate dynamic programming approach to convex quadratic knapsack problems

Computers and Operations Research

A comparative study of linear and semidefinite branch-and-cut methods for solving the minimum graph bisection problem

IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization

An efficient integer programming formulation for the assignment of base stations to controllers in cellular networks

Computer Networks: The International Journal of Computer and Telecommunications Networking

Heuristics to convex quadratic knapsack problems in sorted ADP

ICIC'06 Proceedings of the 2006 international conference on Intelligent Computing - Volume Part I

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

Cardinality constrained combinatorial optimization: Complexity and polyhedra

Discrete Optimization

Facet-defining inequalities for the simple graph partitioning polytope

Discrete Optimization

Cliques and clustering: A combinatorial approach

Operations Research Letters