Facets of the three-index assignment polytope

A New Lagrangian Relaxation Based Algorithm for a Class ofMultidimensional Assignment Problems

Computational Optimization and Applications

Solution of the Cumulative Assignment Problem With a Well-Structured TabuSearch Method

Journal of Heuristics

Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube

Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization

On the Chvátal Rank of Certain Inequalities

Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization

Selected topics on assignment problems

Discrete Applied Mathematics

On the Maximum Noninteger Polyhedron Vertices of the Three-index Axial Assignment Problem

Automation and Remote Control

Randomized parallel algorithms for the multidimensional assignment problem

Applied Numerical Mathematics - Numerical algorithms, parallelism and applications

Polynomial algorithms for finding the asymptotically optimum plan of the multiindex axial assignment problem

Cybernetics and Systems Analysis

Combinatorial properties of noninteger vertices of a polytope in a three-index axial assignment problem

Cybernetics and Systems Analysis

Clique facets of the axial and planar assignment polytopes

Discrete Optimization

Fast separation algorithms for three-index assignment problems

ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization

Characterization of the types of maximum noninteger vertices in the relaxation polyhedron of the four-index axial assignment problem

Computational Mathematics and Mathematical Physics