Sciweavers

4118 search results - page 17 / 824
» Efficient Algorithms for Airline Problem
Sort
View
75
Voted
ESA
2008
Springer
96views Algorithms» more  ESA 2008»
14 years 11 months ago
The Partial Augment-Relabel Algorithm for the Maximum Flow Problem
Abstract. The maximum flow problem is a classical optimization problem with many applications. For a long time, HI-PR, an efficient implementation of the highest-label push-relabel...
Andrew V. Goldberg
TPDS
1998
71views more  TPDS 1998»
14 years 9 months ago
Parallel Algorithms for Relational Coarsest Partition Problems
—Relational Coarsest Partition Problems (RCPPs) play a vital role in verifying concurrent systems. It is known that RCPPs are 3-complete and hence it may not be possible to desig...
Sanguthevar Rajasekaran, Insup Lee
SIAMCOMP
2010
172views more  SIAMCOMP 2010»
14 years 4 months ago
Deterministic Polynomial Time Algorithms for Matrix Completion Problems
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the ...
Gábor Ivanyos, Marek Karpinski, Nitin Saxen...
DAM
2010
120views more  DAM 2010»
14 years 9 months ago
A new approximation algorithm for the multilevel facility location problem
In this paper we propose a new integer programming formulation for the multilevel facility location problem and a novel 3-approximation algorithm based on LP rounding. The linear ...
Adriana Felicia Gabor, Jan-Kees C. W. van Ommeren
GECCO
2000
Springer
141views Optimization» more  GECCO 2000»
15 years 1 months ago
A steady-state evolutionary algorithm for the job shop problem
This paper describes an evolutionary search scheduling algorithm (ESSA) for the job shop scheduling problem (JSSP). If no specific knowledge of the problem is included in the EA t...
Patrick van Bael, Dirk Devogelaere, Marcel Rijckae...