Sciweavers

Share
ORL
1998
97views more  ORL 1998»
9 years 3 months ago
Preemptive on-line scheduling for two uniform processors
This paper considers the problem of preemptive on-line scheduling for two uniform processors in which one of the
Jianjun Wen, Donglei Du
ORL
1998
97views more  ORL 1998»
9 years 3 months ago
The complexity of cover inequality separation
Crowder et al. (Oper. Res. 31 (1983) 803–834) conjectured that the separation problem for cover inequalities for binary integer programs is polynomially solvable. We show that t...
Diego Klabjan, George L. Nemhauser, Craig A. Tovey
ORL
1998
68views more  ORL 1998»
9 years 3 months ago
A fast bipartite network flow algorithm for selective assembly
Bipartite network flow problems naturally arise in applications such as selective assembly and preemptive scheduling. This paper presents fast algorithms for these problems that ...
Satoru Iwata, Tomomi Matsui, S. Thomas McCormick
ORL
1998
116views more  ORL 1998»
9 years 3 months ago
Heuristic solution of the multisource Weber problem as a p-median problem
Good heuristic solutions for large Multisource Weber problems can be obtained by solving related p-median problems in which potential locations of the facilities are users location...
Pierre Hansen, Nenad Mladenovic, Éric D. Ta...
ORL
1998
136views more  ORL 1998»
9 years 3 months ago
A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs
Recently, Becker and Geiger and Bafna, Berman and Fujito gave 2-approximation algorithms for the feedback vertex set problem in undirected graphs. We show how their algorithms can...
Fabián A. Chudak, Michel X. Goemans, Dorit ...
ORL
1998
137views more  ORL 1998»
9 years 3 months ago
Calculation of stability radii for combinatorial optimization problems
We present algorithms to calculate the stability radius of optimal or approximate solutions of binary programming problems with a min sum or min max objective function. Our algori...
Nilotpal Chakravarti, Albert P. M. Wagelmans
ORL
1998
130views more  ORL 1998»
9 years 3 months ago
Accelerating convergence in the Fermat-Weber location problem
This paper presents a simple procedure for accelerating convergence in a generalized Fermat–Weber problem with lp distances. The main idea is to multiply the predetermined step ...
Jack Brimberg, Reuven Chen, Doron Chen
books