Symmetric integer linear programming: Coloring and small integers

Symmetric integer linear programming: Coloring and small integers

0.00 Avg rating0 Votes
Article ID: iaor20073111
Country: Netherlands
Volume: 4
Issue: 1
Start Page Number: 40
End Page Number: 62
Publication Date: Mar 2007
Journal: Discrete Optimization
Authors:
Keywords: programming: branch and bound
Abstract:

This paper presents techniques for handling symmetries in integer linear programs where variables can take integer values, extending previous work dealing exclusively with binary variables. Orthogonal array construction and coloring problems are used as illustrations.

Reviews

Required fields are marked *. Your email address will not be published.