INFORMS Journal on Computing articles from September 2002

INFORMS Journal on Computing archives from September 2002

Special issue on the merging of mathematical programming and constraint programming. (From the Guest Editor).
September 22, 2002... Both mathematical programming and constraint programming have similar goals: solving problems related to feasibility and optimization. However, their roots and traditions are different. Not surprisingly, mathematical programming arose from a...

Logic, optimization, and constraint programming.
September 22, 2002... Because of their complementary strengths, optimization and constraint programming can be profitably merged. Their integration has been the subject of increasing commercial and research activity. This paper summarizes and contrasts the...

Extending an algebraic modeling language to support constraint programming.
September 22, 2002... Although algebraic modeling languages are widely used in linear and nonlinear programming applications, their use for combinatorial or discrete optimization has largely been limited to developing integer linear programming models for solution...

Constraint and integer programming in OPL.
September 22, 2002... In recent years, it has been increasingly recognized that constraint and integer programming have orthogonal and complementary strengths in stating and solving combinatorial optimization applications. In addition, their integration has become...

Efficient intelligent backtracking using linear programming.
September 22, 2002... Intelligent backtracking is a technique used in constraint programming for reducing search in solving combinatorial feasibility problems. The technique uses information derived from small sets of infeasible constraints discovered in one part of...

The role of integer programming techniques in constraint programming's global constraints.
September 22, 2002... Efforts aimed at combining operations research and constraint programming have become increasingly prominent and successful in the last few years. It is now widely recognized that integration, e.g., inference in the form of constraint...

A hybrid exact algorithm for the TSPTW.
September 22, 2002... The Traveling Salesman Problem with Time Windows (TSPTW) is the problem of finding a minimum-cost path visiting a set of cities exactly once, where each city must be visited within a specific time window. We propose a hybrid approach for...

Editorial mission.
September 22, 2002... The INFORMS Journal on Computing (JOC) is a quarterly journal that publishes papers in the intersection of operations research (OR) and computer science (CS). Most papers contain original research, but we also welcome special papers in a...