INFORMS Journal on Computing articles from June 2003

INFORMS Journal on Computing archives from June 2003

From the editor.
June 22, 2003... As the old saw goes, the only constant is change, and JOC has always prided itself on being at the forefront of change at the interface of operations research and computer science. Indeed, as our field has evolved since the journal's birth in...

Tour merging via branch-decomposition.
June 22, 2003... Robertson and Seymour introduced branch-width as a new connectivity invariant of graphs in their proof of the Wagner conjecture. Decompositions based on this invariant provide a natural framework for implementing dynamic-programming algorithms...

Solving the generalized assignment problem: an optimizing and heuristic approach.
June 22, 2003... The classical generalized assignment problem (GAP) may be stated as finding a minimum-cost assignment of tasks to agents such that each task is assigned to exactly one agent and such that each agent's resource capacity is honored. This NP-hard...

Guided local search for the three-dimensional bin-packing problem.
June 22, 2003... The three-dimensional bin-packing problem is the problem of orthogonally packing a set of boxes into a minimum number of three-dimensional bins. In this paper we present a heuristic algorithm based on guided local search. Starting with an upper...

Combinatorial auctions: a survey.
June 22, 2003... Many auctions involve the sale of a variety of distinct assets. Examples are airport time slots, delivery routes, network routing, and furniture. Because of complementarities or substitution effects between the different assets, bidders have...

An exact approach to the strip-packing problem.
June 22, 2003... We consider the problem of orthogonally packing a given set of rectangular items into a given strip, by minimizing the overall height of the packing. The problem is NP-hard in the strong sense, and finds several applications in cutting and...

A new genetic algorithm for the quadratic assignment problem.
June 22, 2003... In this paper we propose several variants of a new genetic algorithm for the solution of the quadratic assignment problem. We designed a special merging rule for creating an offspring that exploits the special structure of the problem. We also...