AccessMyLibrary provides FREE access to over 30 million articles from top publications available through your library.
INFORMS Journal on Computing articles from June 2000
Set up an RSS feed
Create a link to this page
Copy and paste this link tag into your Web page or blog:
INFORMS Journal on Computing archives from June 2000
Reactive GRASP: an application to a matrix decomposition problem in TDMA traffic assignment.
June 22, 2000... A greedy randomized adaptive search procedure (GRASP) is a metaheuristic for combinatorial optimization. In this paper, we describe a GRASP for a matrix decomposition problem arising in the context of traffic assignment in communication...
Solving graph bisection problems with semidefinite programming.
June 22, 2000... An exact solution method for the graph bisection problem is presented. We describe a branch-and-bound algorithm which is based on a cutting plane approach combining semidefinite programming and polyhedral relaxations. We report on extensive...
Market split and basis reduction: towards a solution of the Cornuejols-Dawande instances.
June 22, 2000... At the IPCO VI conference Cornuejols and Dawande proposed a set of 0-1 linear programming instances that proved to be very hard to solve by traditional methods, and in particular by linear programming-based branch-and-bound. They offered these...
Complexity of memory-efficient Kronecker operations with applications to the solution of Markov models.
June 22, 2000... We present new algorithms for the solution of large structured Markov models whose infinitesimal generator can be expressed as a Kronecker expression of sparse matrices. We then compare them with the shuffle-based method commonly used in this...
A simplex-based tabu search method for capacitated network design.
June 22, 2000... The fixed charge capacitated multicommodity network design problem is a well-known problem, of both practical and theoretical significance. This paper presents an efficient procedure to determine tight upper bounds on the optimal solution of...
An ant colony system hybridized with a new local search for the sequential ordering problem.
June 22, 2000... We present a new local optimizer called SOP-3-exchange for the sequential ordering problem that extends a local search for the traveling salesman problem to handle multiple constraints directly without increasing computational complexity. An...