Sciweavers

2179 search results - page 182 / 436
» Symmetry within Solutions
Sort
View
ALGORITHMICA
2010
104views more  ALGORITHMICA 2010»
15 years 6 months ago
Fixed-Parameter Approximation: Conceptual Framework and Approximability Results
The notion of fixed-parameter approximation is introduced to investigate the approximability of optimization problems within the framework of fixed-parameter computation. This work...
Liming Cai, Xiuzhen Huang
ANOR
2010
102views more  ANOR 2010»
15 years 6 months ago
Ejection chain and filter-and-fan methods in combinatorial optimization
The design of effective neighborhood structures is fundamentally important for creating better local search and metaheuristic algorithms for combinatorial optimization. Significant...
César Rego, Fred Glover
125
Voted
CACM
2010
162views more  CACM 2010»
15 years 6 months ago
Understanding the dynamics of information management costs
As data volumes rise and retention periods increase, the appearance of "better, faster and cheaper" storage infrastructure seems like an all-encompassing solution to con...
Paul P. Tallon
CORR
2010
Springer
115views Education» more  CORR 2010»
15 years 6 months ago
Optimal topological simplification of discrete functions on surfaces
We solve the problem of minimizing the number of critical points among all functions on a surface within a prescribed distance from a given input function. The result is achieved...
Ulrich Bauer, Carsten Lange, Max Wardetzky
COR
2008
88views more  COR 2008»
15 years 6 months ago
Solving the swath segment selection problem through Lagrangean relaxation
The Swath Segment Selection Problem (SSSP) is an NP-hard combinatorial optimization problem arising in the context of planning and scheduling satellite operations. It was defined ...
Roberto Cordone, Federico Gandellini, Giovanni Rig...