INFORMS Journal on Computing articles from March 1999

INFORMS Journal on Computing archives from March 1999

Exact solution of the Quadratic Knapsack Problem.
March 22, 1999... The Quadratic Knapsack Problem (QKP) calls for maximizing a quadratic objective function subject to a knapsack constraint, where all coefficients are assumed to be nonnegative and all variables are binary. The problem has applications in...

Computing minimum-weight perfect matchings.
March 22, 1999... We make several observations on the implementation of Edmonds' blossom algorithm for solving minimum-weight perfect-matching problems and we present computational results for geometric problem instances ranging in size from 1,000 nodes up to...

An efficient decomposition algorithm to optimize spare capacity in a telecommunications network.
March 22, 1999... This article presents a new model for the spare capacity allocation problem in a self-healing, mesh SONET telecommunications network. This model is known as the spare capacity network flow model and has not, it is believed, previously appeared...

A set-partitioning-based heuristic for the vehicle routing problem.
March 22, 1999... We develop a generic tabu search heuristic for solving the well-known vehicle routing problem. This algorithm explores the advantages of simple local search and improvement heuristics as well as a complex meta-heuristic. The solutions generated...

A computational study of search strategies for mixed integer programming.
March 22, 1999... The branch-and-bound procedure for solving mixed integer programming (MIP) problems using linear programming relaxations has been used with great success for decades. Over the years, a variety of researchers have studied ways of making the...

Packet routing in telecommunication networks with path and flow restrictions.
March 22, 1999... We address packet-switched telecommunication networks, including ATM, SMDS, and X.25 services. We analyze important extensions of routing models by imposing restrictions on paths and flows. We then study how these modifications affect the...

Improved constructive multistart strategies for the quadratic assignment problem using adaptive memory.
March 22, 1999... Multistart constructive approaches operate by applying a local search procedure to start from different initial solutions produced by a repeated (variable) constructive process. The classical Random Restart procedure and the more recent GRASP...

A class of hard small 0-1 programs.
March 22, 1999... In this article, we consider a class of 0-1 programs that, although innocent looking, is a challenge for existing solution methods. Solving even small instances from this class is extremely difficult for conventional branch-and-bound or...

An approximation scheme for minimizing agreeably weighted variance on a single machine.
March 22, 1999... We consider the problem of minimizing the weighted variance of job completion times on a single machine with job-dependent, agreeable weights. In 1995, Cai derived a fully polynomial time approximation scheme for the special case where the...