7 search results - page 1 / 2 » orl 1998 |
ORL
1998
13 years 4 months ago
1998
This paper considers the problem of preemptive on-line scheduling for two uniform processors in which one of the
ORL
1998
13 years 4 months ago
1998
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...
ORL
1998
13 years 4 months ago
1998
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...
ORL
1998
13 years 4 months ago
1998
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 ...
ORL
1998
13 years 4 months ago
1998
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...