INFORMS Journal on Computing articles from September 2005

INFORMS Journal on Computing archives from September 2005

A modeling layer for constraint-programming libraries.
September 22, 2005... Mathematical-modeling and constraint-programming languages have orthogonal strengths in stating combinatorial optimization problems. Modeling languages typically feature high-level set and algebraic notations, while constraint-programming...

Planar branch decompositions I: the ratcatcher.
September 22, 2005... The notion of branch decompositions and its related connectivity invariant for graphs, branchwidth, were introduced by Robertson and Seymour in their series of papers that proved Wagner's conjecture. Branch decompositions can be used to solve...

Planar branch decompositions II: the cycle method.
September 22, 2005... This is the second of two papers dealing with the relationship of branchwidth and planar graphs. Branch-width and branch decompositions, introduced by Robertson and Seymour, have been shown to be beneficial for both proving theoretical results...

Warm-start routines for solving augmented weighted Tchebycheff network programs in multiple-objective network programming.
September 22, 2005... Three warm-start routines are developed to find initial basic feasible solutions for augmented weighted Tchebycheff network programs, subproblems derived from multiple-objective network-programming problems. In an interactive solution...

Simultaneous generalized hill-climbing algorithms for addressing sets of discrete optimization problems.
September 22, 2005... This paper introduces simultaneous generalized hill-climbing (SGHC) algorithms as a framework for simultaneously addressing a set of related discrete optimization problems using heuristics. Many well-known heuristics can be embedded within the...

The minmax relative regret median problem on networks.(analysis of algorithms for facilities location)
September 22, 2005... We consider a version of the 1-median problem on a network with uncertain weights of nodes. For each node, only an interval estimate of its weight is known. It is required to find the minmax relative regret location, i.e., to minimize the...

Isotonic separation.(methods)
September 22, 2005... Data classification and prediction problems are prevalent in many domains. The need to predict to which class a particular data point belongs has been seen in areas such as medical diagnosis, credit rating, Web filtering, prediction, and stock...

A heuristic for winner determination in rule-based combinatorial auctions.
September 22, 2005... Combinatorial auctions address the sale of materials where there exist complementarities between items. A major stumbling block to the widespread use of combinatorial auctions is the complexity of the winner-determination problem, which is...