INFORMS Journal on Computing articles from March 2005

INFORMS Journal on Computing archives from March 2005

From the editor.(Editorial)
March 22, 2005... Nothing succeeds like success, but sometimes too much success can require attention. Over the past two years, the submission rate of papers to JOC has grown dramatically, having risen 16% during 2004, and the year before that we saw a 38%....

LPFML: a W3C XML Schema for linear and integer programming.(analysis)
March 22, 2005... There are numerous modeling systems for generating linear programs and numerous solvers for optimizing them. However, it is often impossible for modelers to combine their preferred modeling system with their preferred solver. Current modeling...

Primal-dual-based algorithms for a directed network design problem.
March 22, 2005... We present efficient algorithms for a special case of network design problems, the strong-connectivity problem. Given a directed graph G, the strong-connectivity problem seeks a minimum cost strongly connected spanning subgraph of G. Our...

Using extra dual cuts to accelerate column generation.(analysis of mathematical programming)
March 22, 2005... Column generation is often used to solve models with stronger linear-programming relaxations. From the dual standpoint, column-generation processes can be viewed as cutting plane algorithms. In this paper, we present conditions under which it...

Near-optimal solutions of large-scale single-machine scheduling problems.(analysis)
March 22, 2005... The single-machine scheduling problem (SMSP) with release dates concerns the optimal allocation of a set of jobs on a single machine that is not able to process more than one job at a time. Each job is ready to be processed at a release date...

The analytic-center cutting-plane method for variational inequalities: a quadratic-cut approach.
March 22, 2005... We introduce a cutting-plane, analytic-center algorithm for strongly monotone variational inequalities (VIs). The approach extends that of Goffin et al. (1997) and Denault and Goffin (1999). The VI is still treated as a convex feasibility...

Designing communication networks to decompose network control problems.
March 22, 2005... The pressure from today's economic and energy markets demands further distribution of decision making in large, dynamic networks. To this end, distributed model predictive control (MPC) divides the task of operating a dynamic network into a set...

GRASP with path relinking for three-index assignment.(greedy randomized adaptive search procedure)
March 22, 2005... This paper proposes and tests variants of GRASP (greedy randomized adaptive search procedure) with path relinking for the three-index assignment problem (AP3). GRASP is a multistart metaheuristic for combinatorial optimization. It usually...

A new pricing model for competitive telecommunications services using congestion discounts.
March 22, 2005... We propose a two-stage pricing approach that enables providers of telecommunications services to guarantee quality of service (QoS) to their customers. The scheme is intended to shift demand during congestion periods to periods of lower demand...