JCO 1998 | Sciweavers

16

JCO
1998

80views more JCO 1998»

Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem

13 years 4 months ago

We consider the problem of scheduling n jobs with release dates on m identical parallel machines to minimize the average completion time of the jobs. We prove that the ratio of the...

Cynthia A. Phillips, Andreas S. Schulz, David B. S...

claim paper

Read More »

14

click to vote

JCO
1998

136views more JCO 1998»

A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem

13 years 4 months ago

Download www2.research.att.com

Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...

Panos M. Pardalos, Tianbing Qian, Mauricio G. C. R...

claim paper

Read More »

11

click to vote

JCO
1998

80views more JCO 1998»

Semidefinite Programming Relaxations for the Quadratic Assignment Problem

13 years 4 months ago

Download www.diku.dk

Qing Zhao, Stefan E. Karisch, Franz Rendl, Henry W...

claim paper

Read More »

8

click to vote

JCO
1998

47views more JCO 1998»

Localizing Combinatorial Properties for Partitions on Block Graphs

13 years 4 months ago

Download aao.sinica.edu.tw

Gerard J. Chang, Frank K. Hwang, Y. C. Yao

claim paper

Read More »

16

click to vote

JCO
1998

69views more JCO 1998»

Sortabilities of Partition Properties

13 years 4 months ago

Download erdos.csie.ncnu.edu.tw

Consider the partition of a set of integers into parts. Various partition properties have been proposed in the literature to facilitate the restriction of the focus of attention to...

Gerard J. Chang, Fu-Loong Chen, Lingling Huang, Fr...

claim paper

Read More »

17

click to vote

JCO
1998

97views more JCO 1998»

The Travelling Salesman Problem on Permuted Monge Matrices

13 years 4 months ago

Download www.cs.ust.hk

We consider traveling salesman problems (TSPs) with a permuted Monge matrix as cost matrix where the associated patching graph has a specially simple structure: a multistar, a mult...

Rainer E. Burkard, Vladimir G. Deineko, Gerhard J....

claim paper

Read More »

17

click to vote

JCO
1998

102views more JCO 1998»

Facility Location with Dynamic Distance Functions

13 years 4 months ago

Download www.cis.upenn.edu

Facility location problems have always been studied with the assumption that the edge lengths in the network are static and do not change over time. The underlyingnetwork could be ...

Randeep Bhatia, Sudipto Guha, Samir Khuller, Yoram...

claim paper

Read More »

13

click to vote

JCO
1998

96views more JCO 1998»

Constant-Level Greedy Triangulations Approximate the MWT Well

13 years 4 months ago