Integer Linear Programming and Constraint Programming Approaches to a Template Design Problem

Authors:
Les Proll;Barbara Smith
Affiliations:
-;-
Venue:
INFORMS Journal on Computing
Year:
1998

Citing 0
Cited 8

Mathematical Programming Techniques in Constraint Programming: A Short Overview

Journal of Heuristics
Stochastic Constraint Programming: A Scenario-Based Approach

Constraints
Propagation algorithms for lexicographic ordering constraints

Artificial Intelligence
Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints

INFORMS Journal on Computing
Propagation algorithms for lexicographic ordering constraints

Artificial Intelligence
A hybrid benders' decomposition method for solving stochastic constraint programs with linear recourse

CSCLP'05 Proceedings of the 2005 Joint ERCIM/CoLogNET international conference on Constraint Solving and Constraint Logic Programming
A generic method for identifying and exploiting dominance relations

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
A Novel Extremal Optimization Approach for the Template Design Problem

International Journal of Organizational and Collective Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a design problem arising in the color printing industry and discuss a number of integer linear programming and constraint programming approaches to its solution. Despite the apparent simplicity of the problem it presents a challenge for both approaches. We present results for three typical cases and show that the constraint programming approach provides better results, although in some cases after considerable handcrafting. We also show that the results obtained by constraint programming can be improved by a simple goal programming model.