Sciweavers

4110 search results - page 21 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
124
Voted
SIAMAM
2000
89views more  SIAMAM 2000»
15 years 3 months ago
An Efficient Numerical Algorithm for Cracks Partly in Frictionless Contact
An algorithm for a loaded crack partly in frictionless contact is presented. The problem is nonlinear in the sense that the equations of linear elasticity are supplemented by certa...
Gunnar Peters, Johan Helsing
DAC
1996
ACM
15 years 7 months ago
Efficient Approximation Algorithms for Floorplan Area Minimization
Approximation has been shown to be an eective method for reducing the time and space costs of solving various oorplan area minimization problems. In this paper, we present several...
Danny Z. Chen, Xiaobo Hu
GECCO
2006
Springer
287views Optimization» more  GECCO 2006»
15 years 7 months ago
A GA-ACO-local search hybrid algorithm for solving quadratic assignment problem
In recent decades, many meta-heuristics, including genetic algorithm (GA), ant colony optimization (ACO) and various local search (LS) procedures have been developed for solving a...
Yiliang Xu, Meng-Hiot Lim, Yew-Soon Ong, Jing Tang
121
Voted
INFORMATICALT
2006
108views more  INFORMATICALT 2006»
15 years 3 months ago
Experiments with Hybrid Genetic Algorithm for the Grey Pattern Problem
Recently, genetic algorithms (GAs) and their hybrids have achieved great success in solving difficult combinatorial optimization problems. In this paper, the issues related to the ...
Alfonsas Misevicius
115
Voted
IOR
2008
109views more  IOR 2008»
15 years 3 months ago
Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
In 1958, Wagner and Whitin published a seminal paper on the deterministic uncapacitated lot-sizing problem, a fundamental model that is embedded in many practical production plann...
Yongpei Guan, Andrew J. Miller